Applying the Davis-Putnam procedure to non-clausal formulas

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

Volumn 1792, Issue , 2000, Pages 84-94

  Giunchiglia, Enrico ^a   Sebastiani, Roberto ^b  

^a UNIVERSITY OF GENOA   (Italy)

^b UNIVERSITY OF TRENTO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; FORMAL LOGIC;

CNF FORMULAS; CONJUNCTIVE NORMAL FORMS; CONVERSION METHODS; DECISION PROCEDURE; NON-CLAUSAL; PROPOSITIONAL LOGIC; SATISFIABILITY PROBLEMS; TRUTH VALUES;

ARTIFICIAL INTELLIGENCE;

EID: 77951995309     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (22)

1. A. Armando and E. Giunchiglia. Embedding Complex Decision Procedures inside an Interactive Theorem Prover. Annals of Mathematics and Artificial Intelligence, 8(3–4):475–502, 1993.
2. Artificial Intelligence, 81(1,2), 1996. Special Volume on Frontiers in Probelm Solving: Phase Transitions and Complexity.
3. R. E. Bryant. Graph-Based Algorithms for Boolean Function Manipulation. IEEE Transactions on Computers, C-35(8):677–691, August 1986.
4. J. Crawford and L. Auton. Experimental results on the crossover point in 3SAT. Artificial Intelligence, 81, 1996.
5. M. D’Agostino and M. Mondadori. The Taming of the Cut. Journal of Logic and Computation, 4(3):285–319, 1994.
6. M. Davis, G. Longemann, and D. Loveland. A machine program for theorem proving. Journal of the ACM, 5(7), 1962.
7. M. Davis and H. Putnam. A computing procedure for quantification theory. Journal of the ACM, 7:201–215, 1960.
8. T. Boy de la Tour. Minimizing the Number of Clauses by Renaming. In Proc. CADE-90, pages 558–572. Springer-Verlag, 1990.
9. DIMACS. The Second DIMACS International Algorithm Implementation Challenge, Rutgers University, USA, 1993.
10. E. Giunchiglia, F. Giunchiglia, R. Sebastiani, and A. Tacchella. More evaluation of decision procedures for modal logics. In Proc. KR’98, 1998.
11. E. Giunchiglia, A. Massarotto, and R. Sebastiani. Act, and the rest will follow: Exploiting determinism in planning as satisfiability. In Proc. AAAI-98, 1998.
12. F. Giunchiglia and R. Sebastiani. Building decision procedures for modal logics from propositional decision procedures - the case study of modal K. In Proc. CADE-96, Lecture Notes in Artificial Intelligence. Springer Verlag.
13. F. Giunchiglia and R. Sebastiani. A SAT-based decision procedure for ALC. In Proc. KR’96, Cambridge, MA, USA, November 1996.
14. Henry Kautz, David McAllester, and Bart Selman. Exploiting variable dependency in local search. In Abstracts of the Poster Sessions of IJCAI-97, August23–29 1997. Available at http://www.research.att.com/~kautz/papers-ftp/index.html.
15. D.A. Plaisted and S. Greenbaum. A Structure-preserving Clause Form Translation. Journal of Symbolic Computation, 2:293–304, 1986.
16. R. Sebastiani. Applying GSAT to Non-Clausal Formulas. Journal of Artificial Intelligence Research, 1:309–314, 1994.
17. B. Selman, H. Levesque., and D. Mitchell. A New Method for Solving Hard Satisfiability Problems. In Proc. AAAI-92, pages 440–446, 1992.
18. Bart Selman, Henry A. Kautz, and Bram Cohen. Noise strategies for improving local search. In Proc. AAAI-94, pages 337–343. AAAI Press.
19. Jörg Siekmann and Graham Wrightson, editors. Automation of Reasoning: Classical Papers in Computational Logic 1967–1970, volume 2. Springer-Verlag, 1983.
20. G. Tseitin. On the complexity of proofs in propositional logics. Seminars in Mathematics, 8, 1970. Reprinted in [19].
21. T. E. Uribe and M. E. Stickel. Ordered Binary Decision Diagrams and the Davis- Putnam Procedure. In Proc. of the 1st International Conference on Constraints in Computational Logics, 1994.
22. H. Zhang and M. Stickel. Implementing the Davis-Putnam algorithm by tries. Technical report, University of Iowa, August 1994.