A DPLL-based calculus for ground satisfiability modulo theories

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

Volumn 2424, Issue , 2002, Pages 308-319

  Tinelli, Cesare ^a  

^a University of Iowa   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; CALCULATIONS; DECISION THEORY; DIFFERENTIATION (CALCULUS); HEURISTIC ALGORITHMS; HEURISTIC METHODS;

DECISION PROCEDURE; EFFICIENT IMPLEMENTATION; LOGICAL THEORIES; PROPOSITIONAL FORMULAS; SATISFIABILITY CHECKER; SATISFIABILITY MODULO THEORIES; SEARCH HEURISTICS; SEQUENT CALCULUS;

FORMAL LOGIC;

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

References (15)

1. Alessandro Armando, Claudio Castellini, and Enrico Giunchiglia. SAT-based procedures for temporal reasoning. In S. Biundo and M. Fox, editors, Proceedings of the 5th European Conference on Planning (Durham, UK), volume 1809 of Lecture Notes in Computer Science, pages 97-108. Springer, 2000.
2. Gilles Audemard, Piergiorgio Bertoli, Alessandro Cimatti, Artur Kornilowicz, and Roberto Sebastiani. A SAT-based approach for solving formulas over boolean and linear mathematical propositions. In Reiner Hähnle, editor, Proceedings of the 18th International Conference on Automated Deduction, Lecture Notes in Artificial Intelligence. Springer, 2002. (to appear).
3. Clark W. Barrett, David L. Dill, and Jeremy R. Levitt. Validity checking for combinations of theories with equality. In M. K. Srivas and A. Camilleri, editors, Proceedings of the First International Conference on Formal Methods in Computer-Aided Design (Palo Alto, CA), volume 1166 of Lecture Notes in Computer Science, pages 187-201. Springer, 1996.
4. Clark W. Barrett, David L. Dill, and Aaron Stump. Checking satisfiability of first-order formulas by incremental translation to SAT. In J. C. Godskesen, editor, Proceedings of the International Conference on Computer-Aided Verification, Lecture Notes in Computer Science, 2002. (to appear).
5. Nikolaj S. Bjørner, Mark. E. Stickel, and Tomás E. Uribe. A practical integration of first-order reasoning and decision procedures. In W. McCune, editor, Proceedings of the 14th International Conference on Automated Deduction, CADE-14 (Townsville, Australia), volume 1249 of Lecture Notes in Artificial Intelligence, pages 101-115, 1997.
6. Martin Davis, George Logemann, and Donald Loveland. A machine program for theorem proving. Communications of the ACM, 5(7):394-397, July 1962.
7. Martin Davis and Hilary Putnam. A computing procedure for quantification theory. Journal of the ACM, 7(3):201-215, July 1960.
8. Leonardo de Moura and Harald Rueß. Lemmas on demand for satisfiability solvers. Presented at the Fifth International Symposium on the Theory and Applications of Satisfiability Testing (SAT'02), Cincinnati, USA, May 2002.
9. Jon W. Freeman. Improvements to Propositional Satisfiability Search Algorithms. PhD thesis, Departement of computer and Information science, University of Pennsylvania, Philadelphia, 1995.
10. Wilfrid Hodges. Logical features of Horn clauses. In D.M. Gabbay, C.J. Hogger, and J.A. Robinson, editors, Handbook of Logic in Artificial Intelligence and Logic Programming, volume 1, pages 449-503. Oxford University Press, 1993.
11. Joxan Jaffar and Michael Maher. Constraint Logic Programming: A Survey. Journal of Logic Programming, 19/20:503-581, 1994.
12. Shie-Jue Lee and David A. Plaisted. Eliminating duplication with the hyper-linking strategy. Journal of Automated Reasoning, 9(1):25-42, August 1992.
13. Matthew W. Moskewicz, Conor F. Madigan, Ying Zhao, Lintao Zhang, and Sharad Malik. Chaff: Engineering an Efficient SAT Solver. In Proceedings of the 38th Design Automation Conference (DAC'01), June 2001.
14. Greg Nelson and Dave Detlefs. The Simplify user's manual. Compaq Systems Research Center. (http://research.compaq.com/SRC/esc/Simplify.html).
15. Cesare Tinelli. A DPLL-based calculus for ground satisfiability modulo theories. Technical report, Department of Computer Science, University of Iowa, 2002.