Compiling constraint satisfaction problems

Reference LIA-ARTICLE-1999-003doi:10.1016/S0004-3702(99)00077-6View record in Web of Science Record created on 2006-12-13, modified on 2017-05-12

[1]  Edward P. K. Tsang,et al.  Foundations of constraint satisfaction , 1993, Computation in cognitive science.

[2]  B. F. Smith,et al.  On the influence of partitioning schemes on the efficiency of overlapping domain decomposition methods , 1995, Proceedings Frontiers '95. The Fifth Symposium on the Frontiers of Massively Parallel Computation.

[3]  Marc Gyssens,et al.  Decomposing Constraint Satisfaction Problems Using Database Techniques , 1994, Artif. Intell..

[4]  J. Macwilliams.  A theorem on the distribution of weights in a systematic code , 1963 .

[5]  Herbert A. Simon,et al.  The Sciences of the Artificial , 1970 .

[6]  Rina Dechter,et al.  Experimental Evaluation of Preprocessing Algorithms for Constraint Satisfaction Problems , 1994, Artif. Intell..

[7]  Christian Bessiere,et al.  MAC and Combined Heuristics: Two Reasons to Forsake FC (and CBJ?) on Hard Problems , 1996, CP.

[8]  Eugene C. Freuder,et al.  Contradicting Conventional Wisdom in Constraint Satisfaction , 1994, ECAI.

[9]  Rina Dechter,et al.  Tree Clustering for Constraint Networks , 1989, Artif. Intell..

[10]  Ramin Zabih,et al.  Some Applications of Graph Bandwidth to Constraint Satisfaction Problems , 1990, AAAI.

[11]  Johan de Kleer,et al.  An Assumption-Based TMS , 1987, Artif. Intell..

[12]  B. Choueiry.  Abstraction methods for resource allocation , 1994 .

[13]  J. Dekleer.  An assumption-based TMS , 1986 .

[14]  Eugene C. Freuder.  Eliminating Interchangeable Values in Constraint Satisfaction Problems , 1991, AAAI.

[15]  Horst D. Simon,et al.  Partitioning of unstructured problems for parallel processing , 1991 .

[16]  Raimund Seidel,et al.  A New Method for Solving Constraint Satisfaction Problems , 1981, IJCAI.

[17]  B. F. Smith,et al.  On the Innuence of Partitioning Schemes on the Eeciency of Overlapping Domain Decomposition Methods , 1994 .

[18]  Ugo Montanari,et al.  Networks of constraints: Fundamental properties and applications to picture processing , 1974, Inf. Sci..

[19]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning , 1991, Oper. Res..

[20]  Eugene C. Freuder,et al.  Understanding and Improving the MAC Algorithm , 1997, CP.

[21]  Andrew B. Kahng,et al.  Fast spectral methods for ratio cut partitioning and clustering , 1991, 1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers.

[22]  E. Barnes.  An algorithm for partitioning the nodes of a graph , 1981, 1981 20th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes.

[23]  Tad Hogg,et al.  Refining the Phase Transition in Combinatorial Search , 1996, Artif. Intell..

[24]  M. Fiedler.  Algebraic connectivity of graphs , 1973 .

[25]  Shlomo Nir,et al.  NATO ASI Series , 1995 .

[26]  Eugene C. Freuder.  Synthesizing constraint expressions , 1978, CACM.

[27]  Pang,et al.  A new synthesis algorithm for solving CSPsWanlin , 1996 .

[28]  Rina Dechter,et al.  Network-Based Heuristics for Constraint-Satisfaction Problems , 1987, Artif. Intell..

[29]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .