Theoretical analysis of singleton arc consistency and its extensions

Artificial Intelligence

Volumn 172, Issue 1, 2008, Pages 29-41

  Bessiere, Christian ^a   Debruyne, Romuald ^b  

^a UNIV MONTPELLIER   (France)

^b ECOLE DES MINES DE NANTES   (France)

Author keywords

Bidirectional singleton arc consistency; Constraint satisfaction problems; Constructive disjunction; Disjunctive constraints; Local consistency; Singleton arc consistency

Indexed keywords

ALGORITHMS; BINARY SEQUENCES; CONSTRAINT THEORY; FEATURE EXTRACTION;

BIDIRECTIONAL SINGLETON ARC CONSISTENCY; CONSTRAINT SATISFACTION PROBLEMS; CONSTRUCTIVE DISJUNCTION; DISJUNCTIVE CONSTRAINTS; LOCAL CONSISTENCY; SINGLETON ARC CONSISTENCY (SAC);

COMPUTATIONAL COMPLEXITY;

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

References (26)

1. Applegate D., Bixby R., Chvátal V., and Cook W. On the solution of traveling salesman problems. International Congress of Mathematicians. Documenta Mathematica Journal der Deutschen Mathematiker-Vereinigung (1998) 645-656
2. Barták R., and Erben R. A new algorithm for singleton arc consistency. Proceedings FLAIRS'04. Miami Beach, FL (2004), AAAI Press
3. Bennaceur H., and Affane M.S. Partition-k-AC: an efficient filtering technique combining domain partition and arc consistency. Proceedings of the Seventh International Conference on Principles and Practice of Constraint Programming (CP'01). Paphos, Cyprus. LNCS vol. 2239 (2001), Springer-Verlag 560-564 Short paper
4. P. Berlandier, Improving domain filtering using restricted path consistency, in: Proceedings IEEE Conference on Artificial Intelligence and Applications (CAIA'95), 1995
5. Bessiere C. Arc-consistency and arc-consistency again. Artificial Intelligence 65 (1994) 179-190
6. C. Bessiere, R. Debruyne, Optimal and suboptimal singleton arc consistency algorithms, in: Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence (IJCAI'05), Edinburgh, Scotland, 2005, pp. 54-59
7. Bessiere C., Freuder E.C., and Régin J.C. Using constraint metaknowledge to reduce arc consistency computation. Artificial Intelligence 107 (1999) 125-148
8. C. Bessiere, J.C. Régin, Arc consistency for general constraint networks: preliminary results, in: Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence (IJCAI'97), Nagoya, Japan, 1997, pp. 398-404
9. Bessiere C., Régin J.C., Yap R.H.C., and Zhang Y. An optimal coarse-grained arc consistency algorithm. Artificial Intelligence 165 (2005) 165-185
10. Cooper M.C. An optimal k-consistency algorithm. Artificial Intelligence 41 (1989/90) 89-95
11. Debruyne R., and Bessiere C. From restricted path consistency to max-restricted path consistency. Proceedings of the Third International Conference on Principles and Practice of Constraint Programming (CP'97). Linz, Austria. LNCS vol. 1330 (1997), Springer-Verlag 312-326
12. R. Debruyne, C. Bessiere, Some practicable filtering techniques for the constraint satisfaction problem, in: Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence (IJCAI'97), Nagoya, Japan, 1997, pp. 412-417
13. Debruyne R., and Bessiere C. Domain filtering consistencies. Journal of Artificial Intelligence Research 14 (2001) 205-230
14. J.W. Freeman, Improvements to propositional satisfiability search algorithms, PhD thesis, University of Pennsylvania, Philadelphia PA, 1995
15. Freuder E.C. Synthesizing constraint expressions. Communications of the ACM 21 11 (November 1978) 958-966
16. Freuder E.C. A sufficient condition for backtrack-free search. Journal of the ACM 29 1 (January 1982) 24-32
17. C. Lecoutre, S. Cardon, A greedy approach to establish singleton rc consistency, in: Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence (IJCAI'05), Edinburgh, Scotland, 2005, pp. 199-204
18. O. Lhomme, Consistency techniques for numeric csps, in: Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence (IJCAI'93), Chambéry, France, 1993, pp. 232-238
19. Lhomme O. Efficient filtering algorithm for disjunction of constraints. Proceedings of the Ninth International Conference on Principles and Practice of Constraint Programming (CP'03). Kinsale, Ireland. LNCS vol. 2833 (2003), Springer-Verlag 904-908
20. C.M. Li, Anbulagan, Heuristics based on unit propagation for satisfiability problems, in: Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence (IJCAI'97), Nagoya, Japan, 1997, pp. 366-371
21. Mackworth A.K. Consistency in networks of relations. Artificial Intelligence 8 (1977) 99-118
22. McGregor J.J. Relational consistency algorithms and their application in finding subgraph and graph isomorphism. Information Science 19 (1979) 229-250
23. Mohr R., and Henderson T.C. Arc and path consistency revisited. Artificial Intelligence 28 (1986) 225-233
24. Montanari U. Networks of constraints: Fundamental properties and applications to picture processing. Information Science 7 (1974) 95-132
25. Prosser P., Stergiou K., and Walsh T. Singleton consistencies. Proceedings of the Sixth International Conference on Principles and Practice of Constraint Programming (CP'00). Singapore. LNCS vol. 1894 (2000), Springer-Verlag 353-368
26. Van Hentenryck P., Saraswat V.A., and Deville Y. Design, implementation, and evaluation of the constraint language cc(FD). Journal of Logic Programming 37 1-3 (1998) 139-164