Extending dual arc consistency

International Journal of Pattern Recognition and Artificial Intelligence

Volumn 17, Issue 5, 2003, Pages 781-815

  Nagarajan, S ^a   Goodwin, S D ^b   Sattar, A ^c  

^a QNX Software Systems   (Canada)

^b UNIVERSITY OF WINDSOR   (Canada)

^c GRIFFITH UNIVERSITY   (Australia)

Author keywords

Consistency maintenance; Constraint satisfaction; Dual encodings

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; ENCODING (SYMBOLS); PROBLEM SOLVING; THEOREM PROVING;

CONSISTENCY MAINTENANCE;

ARTIFICIAL INTELLIGENCE;

EID: 0141722705     PISSN: 02180014     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218001403002654     Document Type: Conference Paper

References (32)

1. F. Bacchus and P. van Beek, "On the conversion between nonbinary and binary constraint satisfaction problem," Proc. Nat. Conf. Artificial Intelligence, AAAI-98, American Association for Artificial Intelligence, 1998, pp. 311-318.
2. C. Beeri, R. Fagin, D. Maier and M. Yannakakis, "On the desirability of acyclic database schemes," ACM 30, 3 (1983) 479-513.
3. C. Bessiere, "Arc consistency and arc consistency again: research note," Artif. Intell. 65 (1994) 179-190.
4. C. Bessiere, "Nonbinary constraints," Principles and Practice of Constraint Programming, CP-99, Invited Lecture, 1999.
5. C. Bessiere and M. O. Cordier, "Arc-consistency and arc-consistency again," Proc. Nat. Conf. Artificial Intelligence, AAAI-93, American Association for Artificial Intelligence, 1993, pp. 108-113.
6. C. Bessiere, E. C. Freuder, P. Meseguer and J. Larrosa, "On forward checking for nonbinary constraint satisfaction," Principles and Practice of Constraint Programming, CP-99, Vol. 1713, Springer Verlag, 1999, pp. 88-102.
7. C. Bessiere, E. C. Freuder and J. C. Regin, "Using inference to reduce arc consistency computation," Proc. Int. Joint Conf. Artificial Intelligence, IJCAI-95, 1995, pp. 592-598.
8. C. Bessiere and J. C. Regin, "Arc consistency for general constraint networks: preliminary results," Proc. Int. Joint Conf. Artificial Intelligence, IJCAI-97, 1997, pp. 398-404.
9. W. Bibel, "Constraint satisfaction from a deductive viewpoint, " Artif. Intell. 35 (1988) 401-413.
10. R. Debruyne and C. Bessiere, "Some practicable filtering techniques for the constraint satisfaction problem," Proc. Int. Joint Conf. Artificial Intelligence, IJCAI-95, 1997, pp. 412-417.
11. R. Dechter, "On the expressiveness of networks with hidden variables," Proc. Nat. Conf. Artificial Intelligence, AAAI-90, American Association for Artificial Intelligence, 1990, pp. 555-562.
12. R. Dechter, "Constraint networks," Encyclopedia of Artificial Intelligence, ed. S. C. Shapiro, Vol. 1, 2nd edition, Wiley, 1992, pp. 276-285.
13. R. Dechter and J. Pearl, "Tree clustering for constraint networks," Artif. Intell. 38 (1989) 353-366.
14. E. C. Freuder, "Synthesising constraint expressions," Commun. ACM 21 (1978) 958-966.
15. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to Theory of NP-Completeness, Freeman, San Fransisco, 1979.
16. M. Gyssens, P. G. Jeavons and D. A. Cohen, "Decomposing constraint satisfaction problems using database techniques," Artif. Intell. 66 (1994) 57-89.
17. P. Janssen, P. Jegou, B. Nouguier and M. C. Vilarem, "A filtering process for general constraint satisfaction problems: achieving pairwise consistency using an associated binary representation," Proc. IEEE Workshop on Tools for Artificial Intelligence, Fairfax, USA, 1989, pp. 420-427.
18. P. Jeavons, D. Cohen and M. Gyssens, "Closure properties of constraints," J. ACM 44, 4 (1997) 527-548.
19. P. Jegou, "On the consistency of general constraint satisfaction problems," Proc. Nat. Conf. Artificial Intelligence, AAAI-93, American Association for Artificial Intelligence, 1993, pp. 114-119.
20. G. Kondrak and P. van Beek, "A theoretical evaluation of selected backtracking algorithms," Proc. Fourteenth Int. Joint Conf. Artificial Intelligence, 1995, pp. 541-547.
21. G. Kondrak and P. van Beek, "A theoretical evaluation of selected backtracking algorithms," Artif. Intell. 89 (1997) 365-387.
22. A. K. Mackworth, "Consistency in networks of relations," Artif. Intell. 8, 1 (1977) 99-118
23. R. Mohr and T. C. Henderson, "Arc and path consistency revisited," Artif. Intell. 28 (1986) 225-233.
24. R. Mohr and G. Masini, "Good old discrete relaxation," Proc. ECAI-88, 1988, pp. 651-656.
25. W. Pang "Constraint structure in constraint satisfaction problems," PhD. Thesis, University of Regina, November 1998.
26. P. Prosser, K. Stergiou and T. Walsh, "Singleton consistencies," Principles and Practice of Constraint Programming, CP-2000, Vol. 1894, Springer Verlag, 2000, pp. 353-368.
27. J. C. Regin, "A filtering algorithm for constraints of difference," Proc. Nat. Conf. Artificial Intelligence, AAAI-94, American Association for Artificial Intelligence, 1994, pp. 362-367.
28. J. C. Regin, "Generalized arc consistency for global cardinality constraint," Proc. 12th Nat. Conf. Artificial Intelligence, AAAI-96, American Association for Artificial Intelligence, 1996, pp. 209-215.
29. J. C. Regin, "The symmetric alldiff constraint," Proc. Int. Joint Conf. Artificial Intelligence, IJCAI-99, 1999, pp. 420-425.
30. F. Rossi, C. Petrie and V. Dhar, "On the equivalence of constraint satisfaction problems," Proc. 9th ECAI-90, 1990, pp. 550-556.
31. T. Schiex, J. C. Regin, C. Gaspin and G. Verfaillie, "Lazy arc consistency," Proc. Nat. Conf. Artificial Intelligence, AAAI-96, American Association for Artificial Intelligence, 1996, pp. 216-221.
32. K. Stergiou and T. Walsh, "Encodings of nonbinary constraint satisfaction problems," Proc. Nat. Conf. Artificial Intelligence, AAAI-99, American Association for Artificial Intelligence, 1999, pp. 163-168.