SMTInterpol
E904162
SMTInterpol is an SMT solver focused on generating interpolants and solving satisfiability modulo theories problems, particularly over linear arithmetic and related theories.
All labels observed (1)
| Label | Occurrences |
|---|---|
| SMTInterpol canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T11090192 — 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: SMTInterpol Context triple: [Satisfiability Modulo Theories, hasSolver, SMTInterpol]
-
A.
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.
-
B.
Z3 SMT solver
Z3 SMT solver is a high-performance Satisfiability Modulo Theories (SMT) solver developed at Microsoft Research, widely used in program verification, formal methods, and automated reasoning.
-
C.
SMT-LIB2
SMT-LIB2 is a standardized input language and benchmark format for Satisfiability Modulo Theories (SMT) solvers, enabling consistent specification and exchange of logical problems across different tools.
-
D.
Z3: An Efficient SMT Solver
Z3: An Efficient SMT Solver is a high-performance satisfiability modulo theories (SMT) solver widely used in program verification, formal methods, and automated reasoning.
-
E.
TNTSAT
TNTSAT is a French free-to-air satellite television platform that broadcasts the national digital terrestrial TV channels via satellite.
- 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: SMTInterpol Target entity description: SMTInterpol is an SMT solver focused on generating interpolants and solving satisfiability modulo theories problems, particularly over linear arithmetic and related theories.
-
A.
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.
-
B.
Z3 SMT solver
Z3 SMT solver is a high-performance Satisfiability Modulo Theories (SMT) solver developed at Microsoft Research, widely used in program verification, formal methods, and automated reasoning.
-
C.
SMT-LIB2
SMT-LIB2 is a standardized input language and benchmark format for Satisfiability Modulo Theories (SMT) solvers, enabling consistent specification and exchange of logical problems across different tools.
-
D.
Z3: An Efficient SMT Solver
Z3: An Efficient SMT Solver is a high-performance satisfiability modulo theories (SMT) solver widely used in program verification, formal methods, and automated reasoning.
-
E.
TNTSAT
TNTSAT is a French free-to-air satellite television platform that broadcasts the national digital terrestrial TV channels via satellite.
- F. None of above. chosen
Statements (44)
| Predicate | Object |
|---|---|
| instanceOf |
SMT solver
ⓘ
software tool ⓘ theorem prover ⓘ |
| canBeUsedVia |
Java API
ⓘ
linked to:
Java Class Library
command-line interface ⓘ |
| hasApplicationDomain |
formal verification
ⓘ
hardware verification ⓘ program synthesis ⓘ software model checking ⓘ static analysis ⓘ |
| hasComponent |
DPLL(T) style solving engine
ⓘ
linked to:
DPLL(T)
interpolant construction engine ⓘ theory solver for linear arithmetic ⓘ |
| hasLicense |
LGPL
ⓘ
linked to:
GNU Lesser General Public License
|
| hasOutput |
interpolant for unsatisfiable partitions
ⓘ
model for satisfiable formulas ⓘ satisfiability result ⓘ unsat core ⓘ |
| hasPrimaryFunction |
interpolant generation
ⓘ
satisfiability modulo theories solving ⓘ |
| hasProperty |
cross-platform
ⓘ
runs on the Java Virtual Machine ⓘ |
| hasStrength |
efficient interpolant generation
ⓘ
support for linear arithmetic theories ⓘ |
| isDesignedFor | use as backend solver in verification tools ⓘ |
| isFreeSoftware | true ⓘ |
| isOpenSource | true ⓘ |
| isOptimizedFor |
interpolation-heavy workflows
ⓘ
linear arithmetic benchmarks ⓘ |
| isWrittenInLanguage | Java ⓘ |
| participatesIn | SMT-COMP ⓘ |
| supportsFeature |
Craig interpolation
ⓘ
incremental solving ⓘ unsat core extraction ⓘ |
| supportsStandard | SMT-LIB 2 ⓘ |
| supportsTheory |
linear arithmetic
ⓘ
linear integer arithmetic ⓘ linear real arithmetic ⓘ |
| supportsUsageMode |
batch solving
ⓘ
interactive solving ⓘ |
| targetUser |
SMT practitioners
ⓘ
developers of verification tools ⓘ researchers in formal methods ⓘ |
| usesInputFormat | SMT-LIB ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: SMTInterpol Description of subject: SMTInterpol is an SMT solver focused on generating interpolants and solving satisfiability modulo theories problems, particularly over linear arithmetic and related theories.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.
subject linked to:
Satisfiability Modulo Theories (SMT)