Reformulating propositional satisfiability as constraint satisfaction

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 1864, Issue , 2000, Pages 233-246

  Walsh, Toby ^a  

^a UNIVERSITY OF YORK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; ALGORITHMS; ENCODING (SYMBOLS); FORMAL LOGIC; LOCAL SEARCH (OPTIMIZATION); MAPPING;

2-SAT PROBLEMS; CONSTRAINT SATISFACTION; ENCODINGS; LOCAL SEARCH METHOD; POTENTIAL BENEFITS; PROPOSITIONAL SATISFIABILITY; SAT PROBLEMS;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 35248885446     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/3-540-44914-0_14     Document Type: Conference Paper

References (14)

1. H. Bennaceur. The satisfiability problem regarded as a constraint satisfaction problem. In W. Wahlster, editor, Proceedings of the 12th ECAI, pages 155-159. European Conference on Artificial Intelligence, Wiley, 1996.
2. C. Bessiere, P. Meseguer, E. C. Freuder, and J. Larrosa. On forward checking for non-binary constraint satisfaction. In Proceedings of IJCAI-99 Workshop on Non-binary constraints. International Joint Conference on Artificial Intelligence, 1999.
3. F. Bacchus and P. van Beek. On the conversion between non-binary and binary constraint satisfaction problems. In Proceedings of 15th National Conference on Artificial Intelligence, pages 311-318. AAAI Press/The MIT Press, 1998.
4. V. Chvatal and B. Reed. Mick gets some (the odds are on his side). In Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, pages 620-627. IEEE, 1992.
5. R. Debruyne and C. Bessière. Some practicable filtering techniques for the constraint satisfaction problem. In Proceedings of the 15th IJCAI, pages 412-417. International Joint Conference on Artificial Intelligence, 1997.
6. R. Dechter. Enhancement schemes for constraint processing: Backjumping, learning and cutset decompositio. Artificial Intelligence, 41(3):273-312, 1990.
7. M. Davis, G. Logemann, and D. Loveland. A machine program for theorem-proving. Communications of the ACM, 5:394-397, 1962.
8. M. L. Ginsberg. Dynamic backtracking. Journal of Artificial Intelligence Research, 1:25-46, 1993.
9. A. Goerdt. A theshold for unsatisfiability. In I. Havel and V. Koubek, editors, Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, pages 264-274. Springer Verlag, 1992.
10. H. Kautz and B. Selman. BLACKBOX: A new approach to the application of theorem proving to problem solving. In Working notes of the Workshop on Planning as Combinatorial Search, 1998. Held in conjunction with AIPS-98, Pittsburgh, PA, 1998.
11. H. Kautz and B. Selman. The role of domain-specific knowledge in the planning as satisfiability framework. In Proceedings of AIPS-98, Pittsburgh, PA, 1998.
12. C. H. Papadimitriou. On selecting a satisfying truth assigment. In Proceedings of the Conference on the Foundations of Computer Science, pages 163-169, 1991.
13. K. Stergiou and T. Walsh. Encodings of non-binary constraint satisfaction problems. In Proceedings of the 16th National Conference on AI. American Association for Artificial Intelligence, 1999.
14. P. van Beek and X. Chen. Cplan: A constraint programming approach to planning. In Proceedings of 16th National Conference on Artificial Intelligence. AAAI Press/The MIT Press, 1999.