Propagation in CSP and SAT

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

Volumn 4204 LNCS, Issue , 2006, Pages 137-151

  Dimopoulos, Yannis ^a   Stergiou, Kostas ^b  

^a UNIVERSITY OF CYPRUS   (Cyprus)

^b UNIVERSITY OF THE AEGEAN   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; SIGNAL ENCODING; TRANSLATION (LANGUAGES);

COMBINATORIAL PROBLEMS; CONSTRAINT SATISFACTION PROBLEMS;

PROBLEM SOLVING;

EID: 33750286065     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11889205_12     Document Type: Conference Paper

References (14)

1. F. Bacchus. Enhancing Davis Putnam with Extended Binary Clause Reasoning. In Proceedings of AAAI-02, pages 613-619, 2002.
2. H. Bennaceur. The satisfiability problem regarded as a constraint satisfaction problem. In Proceedings of ECAI-1996, pages 125-130, 1996.
3. H. Bennaceur. A Comparison between SAT and CSP Techniques. Constraints, 9:123-138, 2004.
4. C. Bessière, E. Hebrard, and T. Walsh. Local Consistencies in SAT. In Proceedings of SAT-2003, pages 400-407, 2003.
5. R. Debruyne and C. Bessière. Domain Filtering Consistencies. Journal of Artificial Intelligence Research, 14:205-230, 2001.
6. J.W. Freeman. Improvements to Prepositional Satisfiability Search Algorithms. PhD thesis, 1995.
7. E. Freuder. A Sufficient Condition for Backtrack-bounded Search. JACM, 32(4):755-761, 1985.
8. E. Freuder and C. Elfe. Neighborhood Inverse Consistency Preprocessing. In Proceedings of AAAI'96, pages 202-208, 1996.
9. I. Gent. Arc Consistency in SAT. In Proceedings of ECAI-200S, pages 121-125, 2002.
10. S. Kasif. On the Parallel Complexity of Discrete Relaxation in Constraint Satisfaction Networks. Artificial Intelligence, 45(3):275-286, 1990.
11. Chu Min Li and Anbulagan. Heuristics based on unit propagation for satisfiability problems. In Proceedings of IJCAI-97, pages 366-371, 1997.
12. S. Prestwich. Full Dynamic Substitutability by SAT Encoding. In Proceedings of CP-2004, pages 512-526, 2004.
13. A. van Gelder and Y. Tsuji. Satisfiability testing with more reasoning and less guessing. In Cliques, Coloring and Satisfiability, pages 559-586, 1996.
14. T. Walsh. SAT v CSP. In Proceedings of CP-2000, pages 441-456, 2000.