Decomposable constraints

Artificial Intelligence

Volumn 123, Issue 1-2, 2000, Pages 133-156

  Gent, Ian ^c   Stergiou, Kostas ^a   Walsh, Toby ^b  

^a APES Research Group   (United Kingdom)

^b UNIVERSITY OF YORK   (United Kingdom)

^c NONE

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; DATA STRUCTURES; MATHEMATICAL MODELS;

DECOMPOSABLE CONSTRAINTS; NON-BINARY CONSTRAINTS;

ARTIFICIAL INTELLIGENCE;

EID: 0034300531     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(00)00051-5     Document Type: Article

References (27)

1. Bacchus F., van Beek P. On the conversion between non-binary and binary constraint satisfaction problems. Proc. AAAI-98, Madison, WI. 1998.
2. Bessière C., Meseguer P., Freuder E., Larrosa J. On forward checking for non-binary constraint satisfaction. Proc. 5th International Conference on Principles and Practice of Constraint Programming (CP-99), Alexandria, VA. 1999;88-102.
3. Bessière C., Régin J.C. Mac and combined heuristics: Two reasons to forsake fc (and cbj?). Proc. CP-96, Cambridge, MA. 1996;61-75.
4. Bessière C., Régin J.C. Arc consistency for general constraint networks: Preliminary results. Proc. IJCAI-97, Nagoya, Japan. 1997;398-404.
5. Debruyne R., Bessière C. Some practicable filtering techniques for the constraint satisfaction problem. Proc. IJCAI-97, Nagoya, Japan. 1997;412-417.
6. Dechter R. On the expressiveness of networks with hidden variables. Proc. AAAI-90, Boston, MA. 1990;555-562.
7. Dechter R., Pearl J. Tree clustering for constraint networks. Artificial Intelligence. Vol. 38:1989;353-366.
8. Freuder E. A sufficient condition for backtrack-free search. J. ACM. Vol. 29:1982;24-32.
9. Freuder E. A sufficient condition for backtrack-bounded search. J. ACM. Vol. 32:(4):1985;755-761.
10. Freuder E., Elfe C.D. Neighborhood inverse consistency preprocessing. Proc. AAAI-96, Portland, OR. 1996;202-208.
11. Fujita M., Slaney J., Bennett F. Automatic generation of some results in finite algebra. Proc. IJCAI-93, Chambéry, France. 1993;52-57.
12. Gaschnig J. Performance measurement and analysis of certain search algorithms. 1979;Technical Report CMU-CS-79-124, Carnegie-Mellon University, Pittsburgh, PA.
13. Gomes C.P., Selman B. Problem structure in the presence of perturbations. Proc. AAAI-97, Providence, RI. 1997;221-226.
14. Gomes C.P., Selman B., Crato N. Heavy-tailed probability distributions in combinatorial search. Proc. CP-97, Vienna, Austria. 1997;121-135.
15. Kondrak G., van Beek P. A theoretical evaluation of selected backtracking algorithms. Artificial Intelligence. Vol. 89:1997;365-387.
16. McCune W. A Davis-Putnam program and its application to finite first-order model search: Quasigroup existence problems. 1994;Technical Report ANL/MCS-TM-194, Argonne National Laboratory. Available from http://www-unix.mcs.anl.gov/AR/mace/.
17. Meseguer P., Walsh T. Interleaved and discrepancy based search. Proc. ECAI-98, Brighton, UK. 1998;239-243.
18. Mohr R., Masini G. Good old discrete relaxation. Proc. ECAI-88, Munich, Germany. 1988;651-656.
19. Montanari U. Networks of constraints: Fundamental properties and applications to picture processing. Inform. Sci. Vol. 7:1974;95-132.
20. Puget J.F. A C ++ implementation of CLP. 1994;Technical Report 94-01, ILOG S.A. Gentilly, France.
21. Régin J.C. A filtering algorithm for constraints of difference in csps. Proc. AAAI-94, Seattle, WA. 1994;362-367.
22. Régin J.C. Generalized arc consistency for global cardinality constraint. Proc. AAAI-96, Portland, OR. 1996;209-215.
23. Slaney J. FINDER, Finite domain enumerator: Notes and guide. 1992;Technical Report TR-ARP-1/92, Automated Reasoning Program, Australian National University.
24. Stergiou K., Walsh T. The difference all-difference makes. Proc. IJCAI-99, Stockholm, Sweden. 1999;414-419.
25. Van Hentenryck P., Deville Y., Teng C. A generic arc consistency algorithm and its specializations. Artificial Intelligence. Vol. 57:1992;291-321.
26. Zhang H., Stickel M. Implementing the Davis-Putnam algorithm by tries. 1994;Technical Report, University of Iowa.
27. Zhang J., Zhang H. SEM: A system for enumerating models. Proc. IJCAI-95, Montreal, Quebec, Vol. 1. 1995;298-303.