Efficient Satisfiability Modulo Theories via Delayed Theory Combination
- 1 January 2005
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 335-349
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- A SAT-Based Decision Procedure for the Boolean Combination of Difference Constraints2005
- An Incremental and Layered Procedure for the Satisfiability of Linear Arithmetic LogicLecture Notes in Computer Science, 2005
- Some Progress in Satisfiability Checking for Difference Logic2004
- CVC Lite: A New Implementation of the Cooperating Validity Checker2004
- Zapato: Automatic Theorem Proving for Predicate Abstraction RefinementLecture Notes in Computer Science, 2004
- Abstraction-Based Satisfiability Solving of Presburger Arithmetic2004
- DPLL(T): Fast Decision Procedures2004
- Theorem Proving Using Lazy Proof ExplicationLecture Notes in Computer Science, 2003
- ICS: Integrated Canonizer and Solver?2001
- Simplification by Cooperating Decision ProceduresACM Transactions on Programming Languages and Systems, 1979