Nelson–Oppen combination method
E904163
algorithm in automated reasoning
decision procedure framework
method in mathematical logic
method in satisfiability modulo theories
satisfiability decision procedure
theory combination method
The Nelson–Oppen combination method is a decision procedure framework that combines satisfiability solvers for different first-order theories to determine the satisfiability of formulas in their union.
Statements (48)
| Predicate | Object |
|---|---|
| instanceOf |
algorithm in automated reasoning
ⓘ
decision procedure framework ⓘ method in mathematical logic ⓘ method in satisfiability modulo theories ⓘ satisfiability decision procedure ⓘ theory combination method ⓘ |
| appliedIn |
SMT solvers
NERFINISHED
ⓘ
constraint solving ⓘ formal hardware verification ⓘ formal software verification ⓘ model checking ⓘ program verification ⓘ |
| assumes |
decidability of each component theory
ⓘ
pairwise disjoint signatures of component theories ⓘ stably infinite theories ⓘ |
| author |
Derek C. Oppen
NERFINISHED
ⓘ
Greg Nelson NERFINISHED ⓘ |
| basedOn | combination of decision procedures ⓘ |
| category |
algorithms in computer-aided verification
ⓘ
decision procedures in logic ⓘ |
| field |
automated reasoning
ⓘ
first-order logic ⓘ formal methods ⓘ satisfiability modulo theories NERFINISHED ⓘ theory of computation ⓘ |
| goal | decide satisfiability of formulas in the union of first-order theories ⓘ |
| influenced |
design of modern SMT solvers
ⓘ
research on theory combination ⓘ |
| input | quantifier-free formulas over a combination of theories ⓘ |
| namedAfter |
Derek C. Oppen
NERFINISHED
ⓘ
Greg Nelson NERFINISHED ⓘ |
| originalPublicationTitle | Simplification by cooperating decision procedures ⓘ |
| originalPublicationVenue | ACM Transactions on Programming Languages and Systems NERFINISHED ⓘ |
| output | satisfiable or unsatisfiable ⓘ |
| property |
complete for stably infinite, disjoint theories
ⓘ
modular with respect to component theories ⓘ |
| publicationYear | 1979 ⓘ |
| relatedTo |
DPLL(T) framework
NERFINISHED
ⓘ
Shostak combination method NERFINISHED ⓘ satisfiability modulo theories ⓘ |
| typicalComponentTheory |
theory of arrays
GENERATED
ⓘ
theory of linear arithmetic GENERATED ⓘ theory of lists GENERATED ⓘ theory of uninterpreted functions GENERATED ⓘ |
| uses |
arrangements of equalities and disequalities over shared variables
ⓘ
cooperating decision procedures ⓘ equality propagation between theories ⓘ variable (or term) purification ⓘ |
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.
subject surface form:
Satisfiability Modulo Theories