On the relations between SAT and CSP enumerative algorithms

Discrete Applied Mathematics

Volumn 107, Issue 1-3, 2000, Pages 27-40

  Génisson, Richard ^a   Jégou, Philippe ^a  

^a CNRS   (France)

Author keywords

Algorithms; Complexity; Constraint satisfaction; Proportional calculus

Indexed keywords

EID: 0346672474     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(99)00205-X     Document Type: Article

References (14)

1. Chvátal V., Szemerédi E. Many hard examples for resolution. J. ACM. 35(4):1988;759-768.
2. M. Dalal, Tractable deduction in knowledge representation systems, in: Proceedings of the third International Conference on Principles of Knowledge Representation and Reasoning, KR'92, Boston, MA, 1992, pp. 393-402.
3. Davis M., Logemann G., Loveland D. A machine program for theorem proving. Comm. ACM. 5:1962;394-397.
4. Davis M., Putnam H. A computing procedure for quantification theory. J. ACM. 7:1960;201-215.
5. J. de Kleer, A comparison of ATMS and CSP techniques, Proceedings IJCAI'89, 1989.
6. M. Dincbas, P. van Hentenryck, H. Simonis, A. Aggoun, T. Graf, F. Berthier, The constraint logic programming language CHIP, Proceedings of the second International Conference on Fifth Generation Computer Systems, 1988, pp. 249-264.
7. O. Dubois, P. André, Y. Boufkhad, J. Carlier, SAT versus UNSAT, in: D.S. Johnson, M.A. Trick (Eds.), Cliques, Coloring, and Satisfiability, DIMACS Series in DM and TCS, Vol. 26, AMS, Providence, RI, 1996.
8. R. Génisson, On enumerative algorithms and polynomial classes in SAT and constraint satisfaction problems, Ph.D. Dissertation, Laboratoire d'Informatique de Marseille, Université de Provence, France, 1996 (in French).
9. Haralick R.M., Elliot G.L. Increasing tree search efficiency for constraint satisfaction problem. Artificial Intelligence. 14:1980;263-313.
10. Montanari H. Network of constraints: fundamental properties and applications to picture processing. Inform. Sci. 7:1974;95-132.
11. W.V. Quine, A proof procedure for quantification theory, J. Symbolic Logic june (1955) 141-149.
12. D. Sabin, E. Freuder, Contradicting conventional wisdom in constraint satisfaction, in: Proceedings of the 11th European Conference on Artificial Intelligence, ECAI'94, 1994, pp. 125-129.
13. P. van Beek, G. Kondrak, A theoretical evaluation of selected backtracking algorithms, Proceedings of the IJCAI'95, Montreal, Canada, 1995, pp. 541-547.
14. P. van Hentenryck, Constraint Satisfaction in Logic Programming, Logic Programming Series, MIT Press, Cambridge, 1989.