SAT v CSP

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

Volumn 1894, Issue , 2000, Pages 441-456

  Walsh, Toby ^a  

^a UNIVERSITY OF YORK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY; FORMAL LOGIC; MAPPING;

ARC CONSISTENCY; BRANCHING STRUCTURES; CONSTRAINT SATISFACTION; PROPOSITIONAL SATISFIABILITY; SAT PROBLEMS; UNIT PROPAGATION;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 84897712733     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45349-0_32     Document Type: Conference Paper

References (12)

1. K. Apt. Some Remarks on Boolean Constraint Propagation. In New Trends in Constraints, Papers from the Joint ERCIM/Compulog-Net Workshop. Springer, 1999.
2. H. Bennaceur. The satisfiability problem regarded as a constraint satisfaction problem. In W. Wahlster, editor, Proc. of the 12th ECAI, pages 155-159. European Conference on Artificial Intelligence, Wiley, 1996.
3. C. Bessière, P. Meseguer, E. C. Freuder, and J. Larrosa. On Forward Checking for Non-binary Constraint Satisfaction. In A. Brodsky and J. Jaffar, editors, Proc. of Fifth International Conference on Principles and Practice of Constraint Programming (CP99). Springer, 1999.
4. F. Bacchus and P. van Beek. On the conversion between non-binary and binary constraint satisfaction problems. In Proc. of 15th National Conference on Artificial Intelligence, pages 311-318. AAAI Press/The MIT Press, 1998.
5. J. de Kleer. A comparison of ATMS and CSP techniques. In Proc. of the 11th IJCAI. International Joint Conference on Artificial Intelligence, 1989.
6. M. Davis, G. Logemann, and D. Loveland. A machine program for theorem-proving. Communications of the ACM, 5: 394-397, 1962.
7. A. M. Frisch and T. J. Peugniez. Solving non-Boolean satisfiability problems with stochastic local search: A comparison of encodings., 1999. Unpublished manuscript, available from http://www.cs.york.ac.uk/aig/publications.html.
8. J. Gaschnig. Performance measurement and analysis of certain search algorithms. Technical report CMU-CS-79-124, Carnegie-Mellon University, 1979. PhD thesis.
9. M. R. Garey and D. S. Johnson. Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman, 1979.
10. R. Genisson and P. Jegou. Davis and Putnam were already forward checking. In W. Wahlster, editor, Proc. of the 12th ECAI, pages 180-184. European Conference on Artificial Intelligence, Wiley, 1996.
11. R. Mohr and G. Masini. Good old discrete relaxation. In Proc. of the 8th ECAI, pages 651-656, European Conference on Artificial Intelligence, 1988.
12. K. Stergiou and T. Walsh. Encodings of non-binary constraint satisfaction problems. In Proc. of the 16th National Conference on AI. American Association for Artificial Intelligence, 1999.