A comparison between SAT and CSP techniques

Constraints

Volumn 9, Issue 2, 2004, Pages 123-138

  Bennaceur, Hachemi ^a  

^a UNIVERSITÉ PARIS 13   (France)

Author keywords

Constraint satisfaction; Satisfiability

Indexed keywords

ALGORITHMS; BINARY CODES; BOOLEAN ALGEBRA; MATHEMATICAL MODELS; PROBLEM SOLVING; SET THEORY;

CONSTRAINT SATISFACTION; PROPOSITIONAL LOGIC; SATISFIABILITY;

FORMAL LOGIC;

EID: 3543124141     PISSN: 13837133     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:CONS.0000024048.03454.c0     Document Type: Article

References (23)

1. Bennaceur, H., & Plateau, G. (1993). FASTLI: an algorithm for the constraint-satisfaction problem: application to logical inference. Information Processing Letters, 48: 151-158.
2. Bennaceur, H. (1996). The satisfiability problem regarded as constraint-satisfaction problem. In Proc. 12th European Conference on Artificial Intelligence, Budapest, Hungary, pages 125-130.
3. Blair, C. E., Jeroslow, R. G., & Lowe, J. K. (1988). Some results and experiments in programming techniques for prepositional logic. Computers and Operations Research.
4. Dalal, M. (1992). Tractable deduction in knowledge representation systems. In Proceedings of KR'92, Boston MA, pages 393-402.
5. Davis, M., & Putnam, H. (1960). A computing procedure for quantification theory, J. ACM, 7: 201-215.
6. Dechter, R. (1992)."From local to global consistency. Artificial Intelligence, 35(1): 87-107, May.
7. Dechter, R., & Pearl, J. (1988). Network-based Heuristics for constraint-satisfaction problems. Artificial Intelligence, 34: 1-38.
8. Dechter, R., & Pearl, J. (1987). The cycle-cutset method for improving serach performance in AI application. Proc. Third IEEE Conference on AI application, pages 224-230.
9. Dechter, R., & Pearl, J. (1989). Tree clustering for constraint network. Artificial Intelligence, 38: 353-366.
10. De Kleer, J. (1989). A comparison of ATMS and CSP techniques. In Proc. IJCAI, pages 290-296.
11. Freuder, E. C. (1978). Synthesizing constraint expressions. Comm. ACM, 21: 958-966.
12. Freuder, E. C. (1982). A sufficient condition for backtrack-free search. Journal of the ACM, 29(1): 24-32.
13. Génisson, R., & Jégou, P. (2000). On the relations between SAT and CSP enumerative algorithms. Discrete Applied Mathematics 107: 27-40.
14. Haralick, R. M., & Elliot, G. L. (1980). Increasing tree search efficiency for constraint-satisfaction problem. Artificial Intelligence 14:263-313.
15. Hooker, J. N., & Fejki, C. (1987). Branch-and-cut Solution of Inference Problems in Propositional Logic. Research report Carnegie-Mellon University Pittsurgh, Pennsylvania 15213.
16. Hooker, J. N. (1988). A quantitative approach to logical inference. Decision Support Systems, 4: 45-69.
17. Hooker, J. N. (1988). Resolution vs. Cutting Plane Solution of Inference Problems: Some Computational Experience. Research report Carnegie-Mellon University Pittsurgh, Pennsylvania 15213.
18. Jeroslow, R. G., & Wang, J. (1987). Solving Propositional Satisfiability Problems. Research report Georgia Institute of Technology, Atlanta, GA.
19. Mackworth, A. K. (1977). Consistency in networks of relations. Artificial Intelligence, 8: 99-118.
20. Rauzy, A. (1990). Boolean Unification: An Efficient Algorithm, Rapport Interne LaBRI. Universite Bordeaux I.
21. Sabin, D., & Freuder, E. (1994). Contradicting conventional wisdom in constraint-satisfaction. In proceedings of ECAI'94, pages 125-129.
22. Van Beek, P., & Dechter, R. (1995). On the minimality and global consistency of row-convex constraint networks. Journal of the ACM, 42: 543-561.
23. Weigel, R., & Faltings, B. V. (1994). Structuring techniques for constraint-satisfaction problems. In Proceedings of ECAI'94, pages 418-423.