Enhancing Davis Putnam with extended binary clause reasoning

Proceedings of the National Conference on Artificial Intelligence

Volumn , Issue , 2002, Pages 613-619

  Bacchus, Fahiem ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA STRUCTURES; HEURISTIC PROGRAMMING;

BINARY CLAUSE REASONING;

PROBLEM SOLVING;

EID: 0036927346     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. Bacchus, F. 2000. Extending forward checking. In Principles and Practice of Constraint Programming-CP2000, number 1894 in Lecture Notes in Computer Science, 35-51. Springer-Verlag, New York.
2. Bayardo, R. J., and Schrag, R. C. 1997. Using csp lookback techniques to solve real-world sat instances. In Proceedings of the AAAI National Conference (AAAI), 203-208.
3. Biere, A.; Cimatti, A.; Clarke, E.; Fujita, M.; and Zhu, Y. 1999. Symbolic model checking using sat procedures instead of bdds. In Proc. 36th Design Automation Conference, 317-320. IEEE Computer Society.
4. Brafman, R. I. 2001. A simplifier for prepositional formulas with many binary clauses. In Proceedings of the International Joint Conference on Artifical Intelligence (IJCAI), 515-522.
5. Cook, S. A., and Mitchell, D. G. 1997. Finding hard instances of the satisfiability problem: A survey. In Du, D.; Gu, J.; and Pardalos, P. M., eds., Satisfiability Problem: Theory and Applications, volume 35 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society. 1-18.
6. Copty, F.; Fix, L.; Fraer, R.; Giunchiglia, E.; Kamhi, G.; Tacchella, A.; and Vardi, M. Y. 2001. Benefits of bounded model checking at an industrial setting. In Computer Aided Verification (CAV), 436-453.
7. Freeman, J. W. 1995. Improvements to Propositional Satisfiability Search Algorithms. Ph.D. Dissertation, University of Pennsylvania.
8. Kautz, H., and Selman, B. 1992. Planning as satisfiability. In Proceedings of the European Conference on Artificial Intelligence (ECAI), 359-363.
9. Li, C. M., and Anbulagan. 1997. Heuristics based on unit propagation for satisfiability problems. In Proceedings of the International Joint Conference on Artifical Intelligence (IJCAI), 366-371.
10. Li, C. M. 2000. Integrating equivalence reasoning into davis-putnam procedure. In Proceedings of the AAAI National Conference (AAAI), 291-296.
11. Majercik, S. M., and Littman, M. L. 1998. Maxplan: A new approach to probabilistic planning. In Proceedings of the International Conference on Artificial Intelligence Planning and Scheduling (AIPS), 86-93.
12. Moskewicz, M.; Madigan, C.; Zhao, Y.; Zhang, L.; and Malik, S. 2001. Chaff: Engineering an efficient sat solver. In Proc. of the Design Automation Conference (DAC).
13. Rish, I., and Dechter, R. 2000. Resolution versus search: Two strategies for SAT. Journal of Automated Reasoning 24(1):225-275.
14. Simon, L., and Chatalic, P. 2001. Satex: A web-based framework for SAT experimentation (http://www.lri.fr/̃simon/satex/satex.php3). In Kautz, H., and Selman, B., eds., LICS 2001 Workshop on Theory and Applications of Satisfiability Testing (SAT 2001), volume 9 of Electronic Notes in Discrete Mathematics. Elsevier.
15. Van Gelder, A. 2001. Combining preorder and postorder resolution in a satisfiability solver. In Kautz, H., and Selman, B., eds., LICS 2001 Workshop on Theory and Applications of Satisfiability Testing (SAT 2001), volume 9 of Electronic Notes in Discrete Mathematics. Elsevier.
16. Zhang, H. 1997. Sato: An efficient prepositional prover. In Proceedings of the Fourteenth International Conference on Automated Deduction (CADE), volume 1249 of LNCS, 272-275. Springer-Verlag.