Compiling constraint satisfaction problems

Artificial Intelligence

Volumn 115, Issue 2, 1999, Pages 257-287

  Weigel, Rainer ^a   Faltings, Boi ^a  

^a EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; HEURISTIC METHODS; PROBLEM SOLVING; PROGRAM COMPILERS;

CONSTRAINT-BASED REASONING; INTERCHANGEABILITY;

ARTIFICIAL INTELLIGENCE;

EID: 0033325911     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(99)00077-6     Document Type: Article

References (28)

1. Barnes E.R. An algorithm for partitioning the nodes of a graph. SIAM J. Algorithms and Discrete Methods. 3:(4):1992;541-549.
2. Bessière C., Régin J.-C. MAC and combined heuristics: Two reasons to forsake FC (and CBJ). Freuder E.C., Jampel M. Principles and Practice of Constraint Programming. Lecture Notes in Computer Science. 1118:1996;Springer, Berlin.
3. Choueiry B.Y. Abstraction methods for resource allocation, Ph.D. Thesis. 1994;Swiss Federal Institute of Technology in Lausanne.
4. Ciarlet P., Lamur F., Smith B.F. On the influence of the partitioning schemes on the efficiency of overlapping domain decomposition methods. Technical Report 94-23806 UCLA Computational and Applied Mathematics, Los Angeles, CA 90024-1555. 1994.
5. de Kleer J. An assumption-based TMS. Artificial Intelligence. 28:1986;127-162.
6. Dechter R., Meiri I. Experimental evaluation of preprocessing algorithms for constraint satisfaction problems. Artificial Intelligence. 68:1994;211-241.
7. Dechter R., Pearl J. Network-based heuristics for constraint satisfaction problems. Artificial Intelligence. 34:1988;1-38.
8. Dechter R., Pearl J. Tree clustering for constraint networks. Artificial Intelligence. 38:1989;353-366.
9. Fiedler M. Algebraic connectivity of graphs. Czechoslovak Math. J. 23:(98):1973;298-305.
10. Freuder E.C. Synthesizing constraint expressions. Comm. ACM. 21:(11):1978;958-966.
11. Freuder E.C. Eliminating interchangeable values in constraint satisfaction problems. Proc. AAAI-91, Anaheim, CA. 1991;227-233.
12. Freuder E.C. Constraint solving techniques. Tyngu E., Mayoh B., Penjaen J. Constraint Programming of Series F: Computer and Systems Sciences. NATO ASI Series. 1992;51-74.
13. Garey M.R., Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-completeness. 1978;Freeman, San Francisco, CA.
14. Hagen L., Kahng A.B. Fast spectral methods for ration cut partitioning and clustering. Proc. IEEE Internat. Conference on Computer-Aided Design. 1992;10-13.
15. Hogg T. Refining the phase transition in combinatorial search. Artificial Intelligence. 81:1996;127-154.
16. Jeavons P.G., Gyssens M., Cohen D.A. Decomposing constraint satisfaction problems using database techniques. Artificial Intelligence. 66:1994;57-89.
17. Johnson D.S., Aragon C.R., McGeoch L.A., Schevon C. Optimization by simulated annealing: An experimental evaluation, Part II: Graph coloring and number partitioning. Oper. Res. 39:1991;378-406.
18. Liberatore P. Compilation of intractable problems and its application to artificial intelligence. Ph.D. Thesis:1998;Department of Computer Science, University of Rome "La Sapienza"
19. MacWilliams F.J. A theorem on the distribution of weights in a systematic code. Bell Syst. Tech. J. 42:1963;79-94.
20. Montanari U. Networks of constraints: Fundamental properties and application to picture processing. Inform. Sci. 7:1974;95-132.
21. Pang W., Goodwin S.D. A new synthesis algorithm for solving CSPs. Proc. 2nd International Workshop on Constraint-Based Reasoning, Key West, FL. 1996.
22. Sabin D., Freuder E. Contradicting conventional wisdom in constraint satisfaction. Borning A. Principles and Practice of Constraint Programming (PPCP-94): Second International Workshop, Orcas Island, Seattle, WA, USA. Lecture Notes in Computer Science. 874:1994;Springer, Berlin.
23. Sabin D., Freuder E.C. Understanding and Improving the MAC Algorithm. Proc. CP-97, Schloss Hagenberg, Austria. 1997.
24. Seidel P. A new method for solving constraint satisfaction problems. Proc. IJCAI-81, Vancouver, BC. 1981;338-342.
25. Simon H.A. The Science of the Artificial. 1969;MIT Press, Cambridge, MA.
26. Simon H.A. Partitioning of unstructured problems for parallel processing. Computing Systems in Engineering. 2:1991;135-148.
27. Tsang E. Foundations of Constraint Satisfaction. 1993;Academic Press, New York.
28. Zabih R. Some applications of graph bandwidth to constraint satisfaction problems. Proc. AAAI-90, Boston, MA. 1990;46-51.