Boolector
E904161
Boolector is an efficient SMT solver specialized in bit-vectors, arrays, and uninterpreted functions, widely used in formal verification and model checking.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Boolector canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T11090190 — 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: Boolector Context triple: [Satisfiability Modulo Theories, hasSolver, Boolector]
-
A.
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.
-
B.
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.
-
C.
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.
-
D.
CDCL SAT solver
A CDCL SAT solver is an advanced algorithm for solving Boolean satisfiability problems that extends the classic DPLL approach with conflict-driven clause learning and non-chronological backtracking to greatly improve efficiency on large, complex instances.
-
E.
Boyer–Moore theorem prover
The Boyer–Moore theorem prover is an influential automated reasoning system for first-order logic and recursive function theory, notable for pioneering techniques in mechanical proof and program verification.
- 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: Boolector Target entity description: Boolector is an efficient SMT solver specialized in bit-vectors, arrays, and uninterpreted functions, widely used in formal verification and model checking.
-
A.
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.
-
B.
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.
-
C.
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.
-
D.
CDCL SAT solver
A CDCL SAT solver is an advanced algorithm for solving Boolean satisfiability problems that extends the classic DPLL approach with conflict-driven clause learning and non-chronological backtracking to greatly improve efficiency on large, complex instances.
-
E.
Boyer–Moore theorem prover
The Boyer–Moore theorem prover is an influential automated reasoning system for first-order logic and recursive function theory, notable for pioneering techniques in mechanical proof and program verification.
- F. None of above. chosen
Statements (47)
| Predicate | Object |
|---|---|
| instanceOf |
SMT solver
ⓘ
decision procedure ⓘ software tool ⓘ |
| category | formal methods tool ⓘ |
| developedAt | Johannes Kepler University Linz ⓘ |
| focusesOn | quantifier-free bit-vector logics ⓘ |
| hasAuthor | Armin Biere ⓘ |
| hasFeature |
assumption-based solving
ⓘ
bit-blasting ⓘ incremental solving ⓘ model generation ⓘ rewriting-based simplification ⓘ unsat core extraction ⓘ |
| hasInputFormat |
SMT-LIB v2
ⓘ
linked to:
SMT-LIB2
|
| hasInterface |
C API
ⓘ
command-line interface ⓘ |
| hasNameOrigin | portmanteau of "boo" and "vector" (bit-vector) ⓘ |
| isOpenSource | true ⓘ |
| license | MIT License ⓘ |
| optimizedFor |
bit-vector performance
ⓘ
efficiency ⓘ |
| participatedIn | SMT-COMP ⓘ |
| specializedIn |
arrays
ⓘ
bit-vectors ⓘ uninterpreted functions ⓘ |
| supportsLogic |
arrays
ⓘ
bit-vectors ⓘ uninterpreted functions ⓘ |
| supportsOperation |
model extraction
ⓘ
proof-based analysis ⓘ satisfiability checking ⓘ |
| supportsQuantifiers | limited ⓘ |
| supportsSMTLIBLogic |
QF_ABV
ⓘ
QF_AUFBV ⓘ QF_BV ⓘ QF_UFBV ⓘ |
| supportsStandard | SMT-LIB ⓘ |
| supportsTheory |
theory of arrays
ⓘ
theory of fixed-size bit-vectors ⓘ theory of uninterpreted functions ⓘ |
| usedFor |
formal verification
ⓘ
hardware verification ⓘ model checking ⓘ software verification ⓘ |
| usedInDomain |
hardware model checking
ⓘ
software model checking ⓘ |
| writtenInLanguage | C ⓘ |
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: Boolector Description of subject: Boolector is an efficient SMT solver specialized in bit-vectors, arrays, and uninterpreted functions, widely used in formal verification and model checking.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.
subject linked to:
Satisfiability Modulo Theories (SMT)