Lookahead in smodels compared to local consistencies in CSP

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3662 LNAI, Issue , 2005, Pages 266-278

  You, Jia Huai ^a   Liu, Guohua ^a   Yuan, Li Yan ^a   Onuczko, Curtis ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; PROBLEM SOLVING; SET THEORY;

ANSWER SET PROGRAMS; GENERAL CONSTRAINT PROPAGATION MECHANISM; SET PROGRAMMING SYSTEMS;

COMPUTER PROGRAMMING;

EID: 33646045604     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11546207_21     Document Type: Conference Paper

References (16)

1. C. Bessière. Uniform random binary csp generator. Retrieved December 19, 2004, Website www.lirmm.fr/~bessiere/generator.html.
2. C. Bessière and R. Debruyne. Theoretical analysis of singleton arc consistency. In Proc. ECAI'04 Workshop on Modeling and Solving Problems with Constraints, pages 20-29, 2004.
3. C. Bessière, E. Hebrard, and T. Walsh. Local consistencies in SAT. In Proc. Int'l Conf. on Theory and Applications of Satisfiability Testing, pages 400-407, 2003.
4. M. Davis, G. Logemann, and D. Loveland. A machine program for theorem proving. Communications of the ACM, 5(7):394-397, July 1962.
5. R. Debruyne and C. Bessière. Some practical filtering techniques. In Proc. IJCAI'97, pages 412-417, 1997.
6. R. Debruyne and C. Bessière. Domain filtering consistencies. J. Artificial Intelligence Research, 14:205-230, 2001.
7. Islam Elkabani, Enrico Pontelli, and Tran Cao Son. Smodels with CLP and its applications: a simple and effective approach to aggregates in ASP. In Proc. ICLP'04, pages 73-89, 2004.
8. J.W. Freeman. Improvements to prepositional satisfiability search algorithms. PhD thesis, Department of Computer and Information Science, University of Pennsylvania, 1995.
9. M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In Proc. 5th ICLP, pages 1070-1080. MIT Press, 1988.
10. Ian Gent. Arc consistency in SAT. In Proc. ECAI 2003, pages 121-125, 2002.
11. S. Kasif. On the parallel complexity of discrete relaxation in constraint satisfaction networks. Artificial Intelligence, pages 275-286, 1990.
12. I. Niemelä. Logic programs with stable model semantics as a constraint programming paradigm. Annals of Math. and Artificial Intelligence, 25(3-4):241-273, 1999.
13. P. Prosser, K. Stergiou, and T. Walsh. Singleton consistencies. In Proc. CP'00, pages 353-368, 2000.
14. P.Simons. Extending and Implementing the Stable Model Semantics. PhD thesis, Helsinki University of Technology, Helsinki, Finland, 2000.
15. T. Walsh. CSP vs. SAT. In Proc. Principles and Practice of Constraint Programming, pages 441-456, 2000.
16. J. You and G. Hou. Arc consistency + unit propagation = lookahead. In Proc. ICLP'04, pages 314-328, 2004.