Z3: An Efficient SMT Solver
E239177
Z3: An Efficient SMT Solver is a high-performance satisfiability modulo theories (SMT) solver widely used in program verification, formal methods, and automated reasoning.
All labels observed (2)
| Label | Occurrences |
|---|---|
| Z3: An Efficient SMT Solver canonical | 3 |
| "Z3: An Efficient SMT Solver" | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T2169674 — 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: Z3: An Efficient SMT Solver Context triple: [Nikolaj Bjørner, notableWork, Z3: An Efficient SMT Solver]
-
A.
Davis–Putnam algorithm
The Davis–Putnam algorithm is a pioneering procedure in automated theorem proving and propositional logic satisfiability that laid foundational groundwork for modern SAT solvers.
-
B.
Isabelle/HOL: A Proof Assistant for Higher-Order Logic
"Isabelle/HOL: A Proof Assistant for Higher-Order Logic" is a foundational book and system documentation that presents the Isabelle/HOL interactive theorem prover, widely used for formal verification and higher-order logic reasoning in computer science and mathematics.
-
C.
Isabelle proof assistant
Isabelle proof assistant is a widely used interactive theorem prover and generic proof assistant designed for formal verification and mathematical logic, particularly known for its support of higher-order logic.
-
D.
Conference on Automated Deduction
The Conference on Automated Deduction (CADE) is a leading international research conference focused on the theory and applications of automated reasoning and formal deduction in computer science and mathematics.
-
E.
Journal of Automated Reasoning
The Journal of Automated Reasoning is a peer-reviewed academic journal focusing on research in automated reasoning, formal methods, and related areas of computer science and logic.
- 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: Z3: An Efficient SMT Solver Target entity description: Z3: An Efficient SMT Solver is a high-performance satisfiability modulo theories (SMT) solver widely used in program verification, formal methods, and automated reasoning.
-
A.
Davis–Putnam algorithm
The Davis–Putnam algorithm is a pioneering procedure in automated theorem proving and propositional logic satisfiability that laid foundational groundwork for modern SAT solvers.
-
B.
Isabelle/HOL: A Proof Assistant for Higher-Order Logic
"Isabelle/HOL: A Proof Assistant for Higher-Order Logic" is a foundational book and system documentation that presents the Isabelle/HOL interactive theorem prover, widely used for formal verification and higher-order logic reasoning in computer science and mathematics.
-
C.
Isabelle proof assistant
Isabelle proof assistant is a widely used interactive theorem prover and generic proof assistant designed for formal verification and mathematical logic, particularly known for its support of higher-order logic.
-
D.
Conference on Automated Deduction
The Conference on Automated Deduction (CADE) is a leading international research conference focused on the theory and applications of automated reasoning and formal deduction in computer science and mathematics.
-
E.
Journal of Automated Reasoning
The Journal of Automated Reasoning is a peer-reviewed academic journal focusing on research in automated reasoning, formal methods, and related areas of computer science and logic.
- F. None of above. chosen
Statements (59)
| Predicate | Object |
|---|---|
| instanceOf |
SMT solver
ⓘ
research paper ⓘ software tool ⓘ theorem prover ⓘ |
| authors |
Leonardo de Moura
ⓘ
Nikolaj Bjørner ⓘ |
| designedFor |
high performance
ⓘ
scalability ⓘ |
| developedBy | Microsoft Research ⓘ |
| fullName | Z3: An Efficient SMT Solver ⓘ |
| isOpenSource | true ⓘ |
| license | MIT License ⓘ |
| notablePublication |
"Z3: An Efficient SMT Solver"
ⓘ
linked to:
Z3: An Efficient SMT Solver
|
| primaryDeveloper |
Leonardo de Moura
ⓘ
Nikolaj Bjørner ⓘ |
| programmingLanguage | C++ ⓘ |
| publishedIn | TACAS 2008 ⓘ |
| repositoryHost | GitHub ⓘ |
| supportsFeature |
MaxSMT
ⓘ
linked to:
Max-SAT
incremental solving ⓘ interpolation ⓘ model generation ⓘ optimization objectives ⓘ parallel solving ⓘ unsat cores ⓘ |
| supportsInterface |
.NET API
ⓘ
linked to:
.NET Standard Library
C API ⓘ C++ API ⓘ Java API ⓘ
linked to:
Java Class Library
OCaml API ⓘ
linked to:
OCaml
Python API ⓘ SMT-LIB2 input format ⓘ |
| supportsLogic |
first-order logic
ⓘ
quantified formulas ⓘ satisfiability modulo theories ⓘ |
| supportsPlatform |
Linux
ⓘ
Windows ⓘ macOS ⓘ |
| supportsTheory |
algebraic datatypes
ⓘ
arrays ⓘ bit-vectors ⓘ datatypes ⓘ fixedpoint ⓘ floating-point arithmetic ⓘ linear arithmetic ⓘ nonlinear arithmetic ⓘ sequences ⓘ sets ⓘ strings ⓘ uninterpreted functions ⓘ |
| usedFor |
automated reasoning
ⓘ
constraint solving ⓘ formal methods ⓘ program verification ⓘ software model checking ⓘ symbolic execution ⓘ test-case generation ⓘ verification of hardware designs ⓘ verification of security protocols ⓘ |
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: Z3: An Efficient SMT Solver Description of subject: Z3: An Efficient SMT Solver is a high-performance satisfiability modulo theories (SMT) solver widely used in program verification, formal methods, and automated reasoning.
Referenced by (4)
Full triples — surface form annotated when it differs from this entity's canonical label.
subject linked to:
Z3: An Efficient SMT Solver
subject linked to:
Z3: An Efficient SMT Solver
linked to: Z3: An Efficient SMT Solver