DPLL(T): Fast Decision Procedures
Top Cited Papers
- 1 January 2004
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 21 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 ExplicationPublished by Springer Nature ,2003
- Congruence Closure with Integer OffsetsPublished by Springer Nature ,2003
- Boolean satisfiability with transitivity constraintsACM Transactions on Computational Logic, 2002
- A SAT Based Approach for Solving Formulas over Boolean and Linear Mathematical PropositionsPublished by Springer Nature ,2002
- 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 equalityPublished by Springer Nature ,1996
- 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