Optimal and suboptimal singleton arc consistency algorithms

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2005, Pages 54-59

  Bessiere, Christian ^a   Debruyne, Romuald ^b  

^a UNIV MONTPELLIER   (France)

^b ECOLE DES MINES DE NANTES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARC CONSISTENCY; EXPERIMENTAL STUDIES; LARGE PROBLEMS; LOWER BOUNDS; OPTIMAL TIME COMPLEXITY; SINGLETON ARC CONSISTENCY; SPACE COMPLEXITY; TIME COMPLEXITY;

ARTIFICIAL INTELLIGENCE; COMPLEX NETWORKS; OPTIMIZATION;

ALGORITHMS;

EID: 84880714582     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. R. Barták and R. Erben. Singleton arc consistency revised. In ITI Series 2003-153, Prague, 2003.
2. R. Barták and R. Erben. A new algorithm for singleton arc consistency. In Proceedings FLAIRS'04, Miami Beach FL, 2004. AAAI Press.
3. P. Berlandier. Improving domain filtering using restricted path consistency. In Proceedings IEEE-CAIA'95, 1995.
4. C. Bessière and J.C. Régin. Refining the basic constraint propagation algorithm. In Proceedings IJCAI'01, pages 309-315, Seattle WA, 2001.
5. C. Bessière. Arc-consistency and arc-consistency again. Artificial Intelligence, 65:179-190, 1994.
6. R. Debruyne and C. Bessière. From restricted path consistency to max-restricted path consistency. In Proceedings CP'97, pages 312-326, Linz, Austria, 1997.
7. R. Debruyne and C. Bessière. Some practicable filtering techniques for the constraint satisfaction problem. In Proceedings IJCAI'97, pages 412-417, Nagoya, Japan, 1997.
8. R. Debruyne and C. Bessière. Domain filtering consistencies. Journal of Artificial Intelligence Research, 14:205-230, 2001.
9. J.W. Freeman. Improvements to propositional satisfiability search algorithms. PhD thesis, University of Pennsylvania, Philadelphia PA, 1995.
10. E.C. Freuder. Synthesizing constraint expressions. Communications of the ACM, 21(11):958-966, Nov 1978.
11. D. Frost, C. Bessière, R. Dechter, and J.C. Régin. Random uniform csp generators. URL: http://www.lirmm.fr/̃bessiere/generator.html, 1996.
12. O. Lhomme. Consistency techniques for numeric csps. In Proceedings IJCAI'93, pages 232-238, Chambéry, France, 1993.
13. C.M. Li and Ambulagan. Heuristics based on unit propagation for satisfiability problems. In Proceedings IJCAI'97, pages 366-371, Nagoya, Japan, 1997.
14. A.K. Mackworth. Consistency in networks of relations. Artificial Intelligence, 8:99-118, 1977.
15. J.J. McGregor. Relational consistency algorithms and their application in finding subgraph and graph isomorphism. Information Science, 19:229-250, 1979. (Pubitemid 10432392)
16. U. Montanari. Networks of constraints: Fundamental properties and applications to picture processing. Information Science, 7:95-132, 1974.
17. P. Prosser, K. Stergiou, and T Walsh. Singleton consistencies. In Proceedings CP'00, pages 353-368, Singapore, 2000.
18. P. Prosser. An empirical study of phase transition in binary constraint satisfaction problems. Artificial Intelligence, 81:81-109, 1996. (Pubitemid 126349550)
19. Y. Zhang and R.H.C. Yap. Making AC-3 an optimal algorithm. In Proceedings IJCAI'01, pages 316-321, Seattle WA, 2001.