Splitting on Demand in SAT Modulo Theories
- 1 January 2006
- book chapter
- Published by Springer Nature
- p. 512-526
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Splitting on Demand in SAT Modulo Theories2006
- SMT-COMP: Satisfiability Modulo Theories Competition2005
- Abstract DPLL and Abstract DPLL Modulo Theories2005
- CVC Lite: A New Implementation of the Cooperating Validity Checker2004
- DPLL(T): Fast Decision Procedures2004
- Checking Satisfiability of First-Order Formulas by Incremental Translation to SAT2002
- A New Fast Tableau-Based Decision Procedure for an Unquantified Fragment of Set Theory2000
- Simplification by Cooperating Decision ProceduresACM Transactions on Programming Languages and Systems, 1979
- A machine program for theorem-provingCommunications of the ACM, 1962
- A Computing Procedure for Quantification TheoryJournal of the ACM, 1960