Shostak decision procedure in automated reasoning
E1358934
UNEXPLORED
The Shostak decision procedure in automated reasoning is an algorithmic framework for efficiently deciding the satisfiability of formulas in certain combinations of theories, particularly used in SMT (Satisfiability Modulo Theories) solvers.
All labels observed (2)
| Label | Occurrences |
|---|---|
| Davis–Putnam–Logemann–Loveland with Theories | 1 |
| Shostak decision procedure in automated reasoning canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T19112047 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Shostak decision procedure in automated reasoning Context triple: [Robert Shostak, knownFor, Shostak decision procedure in automated reasoning]
-
A.
Nelson–Oppen 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.
-
B.
SPASS automated theorem prover
SPASS automated theorem prover is a first-order logic theorem proving system known for its use of superposition calculus and its application in automated reasoning and formal verification.
-
C.
Vampire automated theorem prover
Vampire automated theorem prover is a high-performance first-order logic reasoning system widely used in automated deduction and formal verification research.
-
D.
Handbook of Automated Reasoning
The "Handbook of Automated Reasoning" is a comprehensive reference work that surveys the theories, methods, and tools used in the field of automated theorem proving and formal reasoning in computer science and logic.
-
E.
Satisfiability Modulo Theories (SMT)
Satisfiability Modulo Theories (SMT) is a framework in computer science and mathematical logic for deciding the satisfiability of logical formulas with respect to background theories such as arithmetic, bit-vectors, arrays, and data types, widely used in verification, synthesis, and automated reasoning.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Shostak decision procedure in automated reasoning Target entity description: The Shostak decision procedure in automated reasoning is an algorithmic framework for efficiently deciding the satisfiability of formulas in certain combinations of theories, particularly used in SMT (Satisfiability Modulo Theories) solvers.
-
A.
Nelson–Oppen 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.
-
B.
SPASS automated theorem prover
SPASS automated theorem prover is a first-order logic theorem proving system known for its use of superposition calculus and its application in automated reasoning and formal verification.
-
C.
Vampire automated theorem prover
Vampire automated theorem prover is a high-performance first-order logic reasoning system widely used in automated deduction and formal verification research.
-
D.
Handbook of Automated Reasoning
The "Handbook of Automated Reasoning" is a comprehensive reference work that surveys the theories, methods, and tools used in the field of automated theorem proving and formal reasoning in computer science and logic.
-
E.
Satisfiability Modulo Theories (SMT)
Satisfiability Modulo Theories (SMT) is a framework in computer science and mathematical logic for deciding the satisfiability of logical formulas with respect to background theories such as arithmetic, bit-vectors, arrays, and data types, widely used in verification, synthesis, and automated reasoning.
- F. None of above. chosen
Referenced by (2)
Full triples — surface form annotated when it differs from this entity's canonical label.
linked to: Shostak decision procedure in automated reasoning