Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL(T)

@article{Nieuwenhuis2006SolvingSA,
  title={Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL(T)},
  author={R. Nieuwenhuis and Albert Oliveras and C. Tinelli},
  journal={J. ACM},
  year={2006},
  volume={53},
  pages={937-977}
}
We first introduce Abstract DPLL, a rule-based formulation of the Davis--Putnam--Logemann--Loveland (DPLL) procedure for propositional satisfiability. This abstract framework allows one to cleanly express practical DPLL algorithms and to formally reason about them in a simple way. Its properties, such as soundness, completeness or termination, immediately carry over to the modern DPLL implementations with features such as backjumping or clause learning.We then extend the framework to… Expand
827 Citations
A bisimulation between DPLL(T) and a proof-search strategy for the focused sequent calculus
  • 10
  • Highly Influenced
  • PDF
Lazy Satisability Modulo Theories
  • R. Sebastiani
  • Computer Science
  • J. Satisf. Boolean Model. Comput.
  • 2007
  • 98
  • PDF
Theory propagation and rational-trees
  • 10
  • PDF
Satisfiability Modulo Theories
  • 97
  • PDF
Understanding and Improving a Modern SAT Solver
  • 18
  • PDF
Theory Propagation and Rational-Trees Ed Robbins
  • PDF
From KSAT to Delayed Theory Combination: Exploiting DPLL Outside the SAT Domain
  • 5
  • PDF
Generic decision procedures for axiomatic rst-order theories
  • 1
  • Highly Influenced
  • PDF
A system for CSP solving through satisfiability Modulo theories
  • 3
  • Highly Influenced
  • PDF
Lazy proofs for DPLL(T)-based SMT solvers
  • 15
  • PDF
...
1
2
3
4
5
...

References

SHOWING 1-3 OF 3 REFERENCES
Theorem Proving Using Lazy Proof Explication
  • 136
  • Highly Influential
  • PDF
A SAT-based Decision Procedure for the Boolean Combination of Difference Constraints
  • 59
  • Highly Influential
  • PDF
A SAT-based decision
  • 2004