Statements (19)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:appliesTo |
gptkb:first-order_logic
|
| gptkbp:category |
decision procedure
|
| gptkbp:field |
computer science
automated theorem proving satisfiability modulo theories |
| https://www.w3.org/2000/01/rdf-schema#label |
Nelson–Oppen procedure
|
| gptkbp:introducedIn |
1979
|
| gptkbp:namedAfter |
gptkb:Greg_Nelson
Derek C. Oppen |
| gptkbp:publishedIn |
gptkb:Journal_of_the_ACM
|
| gptkbp:purpose |
combine decision procedures for disjoint theories
|
| gptkbp:relatedTo |
Shostak algorithm
congruence closure |
| gptkbp:requires |
theories to be stably infinite
theories to have disjoint signatures |
| gptkbp:usedIn |
SMT solvers
|
| gptkbp:bfsParent |
gptkb:Greg_Nelson
|
| gptkbp:bfsLayer |
6
|