DPLL(T)

E904156
SMT solving framework algorithmic framework decision procedure framework

DPLL(T) is a framework that extends the classic DPLL SAT-solving algorithm with theory solvers to efficiently decide satisfiability modulo background theories such as arithmetic, arrays, or bit-vectors.

Try in SPARQL Jump to: Statements Referenced by

Statements (45)

Predicate Object
instanceOf SMT solving framework ⓘ
algorithmic framework ⓘ
decision procedure framework ⓘ
abbreviationOf Davis–Putnam–Logemann–Loveland with Theories NERFINISHED ⓘ
basedOn DPLL NERFINISHED ⓘ
checks theory consistency of partial assignments ⓘ
combines Boolean reasoning ⓘ
theory reasoning ⓘ
communicatesVia interface between SAT solver and theory solver ⓘ
designedFor Satisfiability Modulo Theories NERFINISHED ⓘ
enables incremental theory reasoning ⓘ
lazy theory instantiation ⓘ
extends DPLL SAT-solving algorithm NERFINISHED ⓘ
goal efficient decision procedures for SMT problems ⓘ
hasComponent Boolean search engine ⓘ
clause learning ⓘ
conflict analysis ⓘ
theory consistency checking ⓘ
theory propagation ⓘ
improvesOn pure SAT-based decision procedures for rich theories ⓘ
influenced modern SMT solver architectures ⓘ
operatesOn Boolean abstraction of theory atoms ⓘ
originField automated reasoning ⓘ
formal methods ⓘ
relatedTo CDCL ⓘ
Nelson–Oppen combination method NERFINISHED ⓘ
requires theory solver for each background theory ⓘ
supports arithmetic theories ⓘ
arrays ⓘ
background theories ⓘ
bit-vectors ⓘ
combinations of theories ⓘ
linear arithmetic ⓘ
uninterpreted functions ⓘ
typicalImplementationInvolves backjumping GENERATED ⓘ
conflict-driven clause learning GENERATED ⓘ
unit propagation GENERATED ⓘ
usedIn SMT-LIB compliant solvers ⓘ
Satisfiability Modulo Theories solvers NERFINISHED ⓘ
hardware verification ⓘ
model checking ⓘ
program analysis ⓘ
software verification ⓘ
uses SAT solver NERFINISHED ⓘ
theory solver ⓘ

Referenced by (2)

Full triples — surface form annotated when it differs from this entity's canonical label.

Satisfiability Modulo Theories (SMT) → typicalArchitecture → DPLL(T) ⓘ
subject surface form: Satisfiability Modulo Theories
Satisfiability Modulo Theories (SMT) → usesAlgorithm → DPLL(T) ⓘ
subject surface form: Satisfiability Modulo Theories