Abstract DPLL and Abstract DPLL modulo theories

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

Volumn 3452 LNAI, Issue , 2005, Pages 36-50

  Nieuwenhuis, Robert ^a   Oliveras, Albert ^a   Tinelli, Cesare ^b  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b University of Iowa   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; LEARNING ALGORITHMS; THEOREM PROVING;

CLAUSE LEARNING; DAVIS-PUTNAM-LOGEMANN-LOVELAND (DPLL) PROCEDURE; DPLL MODULO THEORIES; NON-CHRONOLOGICAL BACKTRACKING;

LOGIC PROGRAMMING;

EID: 26844448316     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-32275-7_3     Document Type: Conference Paper

References (14)

1. +02. G. Audemard, P. Bertoli, A. Cimatti, A. Kornilowicz, and R. Sebastiani. A SAT based approach for solving formulas over boolean and linear mathematical propositions. In CADE-18, LNCS 2392, pages 195-210, 2002.
2. ACGOO. Alessandro Armando, Claudio Castellini, and Enrico Giunchiglia. SAT-based procedures for temporal reasoning. In Procs. 5th European Conference on Planning, LNCS 1809, pages 97-108, 2000.
3. BB04. Clark W. Barrett and Sergey Berezin. CVC lite: A new implementation of the cooperating validity checker. Category B. In Procs. 16th Int. Conf. Computer Aided Verification (CAV), LNCS 3114, pages 515-518, 2004.
4. BDS02. Clark Barrett, David Dill, and Aaron Stump. Checking satisfiability of first-order formulas by incremental translation into sat. In Procs. 14th Intl. Conf. on Computer Aided Verification (CAV), LNCS 2404, 2002.
5. DLL62. Martin Davis, George Logemann, and Donald Loveland. A machine program for theorem-proving. Comm. of the ACM, 5(7):394-397, 1962.
6. dMR02. Leonardo de Moura and Harald Rueß. Lemmas on demand for satisfiability solvers. In Procs. 5th Int. Symp. on the Theory and Applications of Satisfiability Testing, SAT'02, pages 244-251, 2002.
7. DP60. Martin Davis and Hilary Putnam. A computing procedure for quantification theory. Journal of the ACM, 7:201-215, 1960.
8. FJOS03. C. Flanagan, R. Joshi, X. Ou, and J. B. Saxe. Theorem proving using lazy proof explanation. In Procs. 15th Int. Conf. on Computer Aided Verification (CAV), LNCS 2725, 2003.
9. +04. H. Ganzinger, G. Hagen, R. Nieuwenhuis, A. Oliveras, and C. Tinelli. DPLL(T): Fast decision procedures. In Procs. 16th Int. Conf. Computer Aided Verification (CAV), LNCS 3114, pages 175-188, 2004.
10. GN02. E. Goldberg and Y. Novikov. BerkMin: A fast and robust SAT-solver. In Design, Automation, and Test in Europe (DATE '02), pages 142-149, 2002.
11. +01. M. Moskewicz, Conor. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an Efficient SAT Solver. In Proc. 38th Design Automation Conference (DAC'01), 2001.
12. MSS99. Joao Marques-Silva and Karem A. Sakallah. GRASP: A search algorithm for propositional satisfiability. IEEE Trans. Comput., 48(5):506-521.
13. Tin02. Cesare Tinelli. A DPLL-based calculus for ground satisfiability modulo theories. In Procs. 8th European Conf. on Logics in Artificial Intelligence, LNAI 2424, pages 308-319, 2002.
14. Zha97. Hantao Zhang. SATO: An efficient propositional prover. In CADE-14, LNCS 1249, pages 272-275, 1997.