Local consistencies in SAT

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

Volumn 2919, Issue , 2004, Pages 299-314

  Bessière, Christian ^a   Hebrard, Emmanuel ^b   Walsh, Toby ^b  

^a CNRS   (France)

^b UNIVERSITY COLLEGE CORK   (Ireland)

Author keywords

[No Author keywords available]

Indexed keywords

ENCODING (SYMBOLS); FORMAL LOGIC;

ARC CONSISTENCY; BINARY CONSTRAINTS; ENCODINGS; LOCAL CONSISTENCY; PROPOSITIONAL SATISFIABILITY; RUNTIMES; SEARCH TREES; UNIT PROPAGATION;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 35048825734     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24605-3_23     Document Type: Article

References (17)

1. F. Bacchus, X. Chen, P. van Beek, and T. Walsh. Binary vs. non-binary constraints. Artificial Intelligence, 140(1-2):1-37, 2002.
2. C. Bessière, A. Chmeiss, and L. Saïs. Neighborhood-based variable ordering heuristics for the constraint satisfaction problem. In Proceedings CP'01, pages 565-569, 2001. Short paper.
3. C. Bessière, P. Meseguer, E.C. Freuder, and J. Larrosa. On forward checking for non-binary constraint satisfaction. Artificial Intelligence, 141:205-224, 2002.
4. C. Bessière and J.C. Régin. MAC and combined heuristics: two reasons to forsake FC (and CBJ?) on hard problems. In Proceedings CP'96, pages 61-75, 1996.
5. C. Bessière and J.C. Régin. Refining the basic constraint propagation algorithm. In Proceedings IJCAI'01, pages 309-315, 2001.
6. M. Davis, G. Logemann, and D. Loveland. A machine program for theorem proving. Communications of the ACM, 5:394-397, 1962.
7. Romuald Debruyne. A property of path inverse consistency leading to an optimal PIC algorithm. In Proceedings ECAI'00, pages 88-92, 2000.
8. R. Dechter and P. van Beek. Local and global relational consistency. Theoretical Computer Science, 173(1):283-308, 1997.
9. E.C. Freuder. A sufficient condition for backtrack-bounded search. Journal of the ACM, 32:755-761, 1985.
10. I.P. Gent. Arc consistency in SAT. In Proceedings ECAI'02, 2002.
11. E. Golberg and Y. Novikov. Berkmin: a fast and robust sat-solver. In Proceeding DATE'02, pages 142-149, 2002.
12. S. Kasif. On the parallel complexity of discrete relaxation in constraint satisfaction networks. Artificial Intelligence, 45:275-286, 1990.
13. B.A. Nadel. Constraint satisfaction algorithms. Computational Intelligence, 5:188-224, 1989.
14. P. van Beek and R. Dechter. Constraint tightness and looseness versus local and global consistency. Journal of the ACM, 44:549-566, 1997.
15. Peter van Beek and Kent Wilken. Fast optimal instruction scheduling for single-issue processors with arbitrary latencies. Lecture Notes in Computer Science, 2239:625-639, 2001.
16. G. Verfaillie, D. Martinez, and G. Bessière. A generic customizable framework for inverse local consistency. In Proceeding AAAI'99, pages 169-174, 1999.
17. T. Walsh. SAT v CSP. In Proceedings CP'00, pages 441-456, 2000.