DPLL(T): Fast Decision Procedures
- 1 January 2004
- book chapter
- Published by Springer Nature
- p. 175-188
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessorsJournal of Symbolic Computation, 2003
- Theorem Proving Using Lazy Proof ExplicationLecture Notes in Computer Science, 2003
- Congruence Closure with Integer OffsetsLecture Notes in Computer Science, 2003
- Boolean satisfiability with transitivity constraintsACM Transactions on Computational Logic, 2002
- A SAT Based Approach for Solving Formulas over Boolean and Linear Mathematical Propositions2002
- Processor verification using efficient reductions of the logic of uninterpreted functions to propositional logicACM Transactions on Computational Logic, 2001
- Validity checking for combinations of theories with equality1996
- Variations on the Common Subexpression ProblemJournal of the ACM, 1980
- Fast Decision Procedures Based on Congruence ClosureJournal of the ACM, 1980
- A Computing Procedure for Quantification TheoryJournal of the ACM, 1960