Efficient Satisfiability Modulo Theories via Delayed Theory Combination
- 1 January 2005
- book chapter
- Published by Springer Nature
- p. 335-349
- https://doi.org/10.1007/11513988_34
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- A SAT-Based Decision Procedure for the Boolean Combination of Difference ConstraintsPublished by Springer Nature ,2005
- An Incremental and Layered Procedure for the Satisfiability of Linear Arithmetic LogicPublished by Springer Nature ,2005
- Some Progress in Satisfiability Checking for Difference LogicPublished by Springer Nature ,2004
- CVC Lite: A New Implementation of the Cooperating Validity CheckerPublished by Springer Nature ,2004
- Zapato: Automatic Theorem Proving for Predicate Abstraction RefinementPublished by Springer Nature ,2004
- Abstraction-Based Satisfiability Solving of Presburger ArithmeticPublished by Springer Nature ,2004
- DPLL(T): Fast Decision ProceduresPublished by Springer Nature ,2004
- Theorem Proving Using Lazy Proof ExplicationPublished by Springer Nature ,2003
- ICS: Integrated Canonizer and Solver?Published by Springer Nature ,2001
- Simplification by Cooperating Decision ProceduresACM Transactions on Programming Languages and Systems, 1979