Domain filtering consistencies for non-binary constraints

Artificial Intelligence

Volumn 172, Issue 6-7, 2008, Pages 800-822

  Bessiere, Christian ^a   Stergiou, Kostas ^b   Walsh, Toby ^c  

^a LIRMM   (France)

^b UNIVERSITY OF THE AEGEAN   (Greece)

^c UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

Constraint programming; Constraint satisfaction problems; Inverse consistency; Local consistency; Non binary constraints; Pairwise consistency

Indexed keywords

ALGORITHMS; PROBLEM SOLVING;

BINARY CONSTRAINTS; CONSTRAINT PROGRAMMING; INVERSE CONSISTENCY; PAIRWISE CONSISTENCY;

CONSTRAINT THEORY;

EID: 38649106118     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2007.10.016     Document Type: Article

References (23)

1. Apt K.R. Principles of Constraint Programming (2003), Cambridge University Press
2. Bacchus F., Chen P., van Beek X., and Walsh T. Binary vs. non-binary CSPs. Artif. Intell. 140 (2002) 1-37
3. P. Berlandier, Improving domain filtering using restricted path consistency, in: Proceedings of IEEE CAIA-95, 1995, pp. 32-37
4. Bessiere C. Constraint propagation. In: Rossi F., van Beek P., and Walsh T. (Eds). Handbook of Constraint Programming (2006), Elsevier (Chapter 3)
5. Bessière C., Meseguer P., Freuder E.C., and Larrosa J. On forward checking for non-binary constraint satisfaction. Artif. Intell. 141 (2002) 205-224
6. C. Bessière, J.C. Régin, Arc consistency for general constraint networks: Preliminary results, in: Proceedings of IJCAI'97, 1996, pp. 398-404
7. C. Bessière, J.C. Régin, MAC and combined heuristics: Two reasons to forsake FC (and CBJ?) on hard problems, in: Proceedings of CP'96, 1996, pp. 61-75
8. Bessière C., Régin J.C., Yap R., and Zhang Y. An optimal coarse-grained arc consistency algorithm. Artif. Intell. 165 2 (2005) 165-185
9. R. Debruyne, C. Bessière, From restricted path consistency to max-restricted path consistency, in: Proceedings of CP-97, 1997, pp. 312-326
10. Debruyne R., and Bessière C. Domain filtering consistencies. J. Artif. Intell. Res. 14 (2001) 205-230
11. Dechter R., and van Beek P. Local and global relational consistency. Theoret. Comput. Sci. 173 (1997) 283-308
12. Freuder E. A sufficient condition for backtrack-bounded search. JACM 32 4 (1985) 755-761
13. E. Freuder, C. Elfe, Neighborhood inverse consistency preprocessing, in: Proceedings of AAAI'96, 1996, pp. 202-208
14. Gyssens M. On the complexity of join dependencies. ACM Trans. Database Syst. 11 1 (1986) 81-108
15. P. Janssen, P. Jégou, B. Nouguier, M.C. Vilarem, A filtering process for general constraint satisfaction problems: Achieving pairwise consistency using an associated binary representation, in: Proceedings of IEEE Workshop on Tools for Artificial Intelligence, 1989, pp. 420-427
16. P. Jégou, Contribution à l'étude des problèmes de satisfaction de contraintes: algorithmes de propagation et de résolution; propagation de contraintes dans les réseaux dynamiques, PhD thesis, CRIM, University Montpellier II, 1991 (in French)
17. P. Jégou, On the consistency of general constraint satisfaction problems, in: Proceedings of AAAI'93, 1993, pp. 114-119
18. A. Mackworth, Consistency in networks of relations, in: Artificial Intelligence, 1977, pp. 99-118
19. A.K. Mackworth, On reading sketch maps, in: Proceedings IJCAI'77, 1977, pp. 598-606
20. N. Mamoulis, K. Stergiou, Solving non-binary CSPs using the hidden variable encoding, in: Proceedings of CP-2001, 2001, pp. 168-182
21. K. Stergiou, T. Walsh, Encodings of non-binary constraint satisfaction problems, in: Proceedings of AAAI'99, 1999, pp. 163-168
22. van Beek P., and Dechter R. On the minimality and global consistency of row-convex constraint networks. JACM 42 3 (1995) 543-561
23. G. Verfaillie, D. Martinez, C. Bessière, A generic customizable framework for inverse local consistency, in: Proceedings of AAAI'99, 1999, pp. 169-174