DPLL(T) with Exhaustive Theory Propagation and Its Application to Difference Logic
Authors:
- 1 January 2005
- book chapter
- Published by Springer Nature
- p. 321-334
Abstract
No abstract availableKeywords
This publication has 24 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
- An Experimental Evaluation of Ground Decision ProceduresLecture Notes in Computer Science, 2004
- Boolean satisfiability with transitivity constraintsACM Transactions on Computational Logic, 2002
- Modeling and Verifying Systems Using a Logic of Counter Arithmetic with Lambda Expressions and Uninterpreted Functions2002
- Checking Satisfiability of First-Order Formulas by Incremental Translation to SAT2002
- SAT-Based Procedures for Temporal ReasoningLecture Notes in Computer Science, 2000
- A machine program for theorem-provingCommunications of the ACM, 1962