Z3 SMT solver
E239176
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.
All labels observed (4)
| Label | Occurrences |
|---|---|
| Z3 SMT solver canonical | 5 |
| Z3 theorem prover | 2 |
| Alt-Ergo | 1 |
| Z3 | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T2169663 — 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 SMT solver Context triple: [Nikolaj Bjørner, knownFor, Z3 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.
SCIP
SCIP is the ICAO airport code for Mataveri International Airport, the main air gateway to Easter Island in Chile.
-
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.
LCF theorem prover
The LCF theorem prover is an early interactive proof system that pioneered the use of higher-order logic and the LCF-style architecture, forming the conceptual basis for later provers like HOL and Isabelle.
-
E.
Maxima
Maxima is the first daughter of Facebook co-founder Mark Zuckerberg and philanthropist Priscilla Chan.
- 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 SMT solver Target entity description: 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.
-
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.
SCIP
SCIP is the ICAO airport code for Mataveri International Airport, the main air gateway to Easter Island in Chile.
-
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.
LCF theorem prover
The LCF theorem prover is an early interactive proof system that pioneered the use of higher-order logic and the LCF-style architecture, forming the conceptual basis for later provers like HOL and Isabelle.
-
E.
Maxima
Maxima is the first daughter of Facebook co-founder Mark Zuckerberg and philanthropist Priscilla Chan.
- F. None of above. chosen
Statements (48)
| Predicate | Object |
|---|---|
| instanceOf |
SMT solver
ⓘ
software tool ⓘ theorem prover ⓘ |
| developer |
Leonardo de Moura
ⓘ
Microsoft Research ⓘ Nikolaj Bjørner ⓘ |
| hasAPI |
.NET API
ⓘ
C API ⓘ C++ API ⓘ
linked to:
C++
Java API ⓘ
linked to:
Java Class Library
Python API ⓘ |
| hostPlatform |
Linux
ⓘ
Windows ⓘ macOS ⓘ |
| isOpenSource | true ⓘ |
| license | MIT License ⓘ |
| partOf |
Microsoft Research tools ecosystem
ⓘ
linked to:
Microsoft Research
|
| programmingLanguage | C++ ⓘ |
| supportsFeature |
incremental solving
ⓘ
model generation ⓘ optimization (MaxSMT / Pseudo-Boolean) ⓘ parallel solving (for some configurations) ⓘ quantifier instantiation ⓘ unsat core extraction ⓘ |
| supportsInputFormat |
DIMACS (via front-ends)
ⓘ
SMT-LIB2 ⓘ |
| supportsLogic | SMT-LIB logics ⓘ |
| supportsTheory |
arrays
ⓘ
bit-vectors ⓘ datatypes ⓘ fixed-size bit-vectors ⓘ floating-point arithmetic ⓘ linear arithmetic ⓘ non-linear arithmetic ⓘ quantifiers ⓘ uninterpreted functions ⓘ |
| useCase |
automated reasoning
ⓘ
bug finding in software ⓘ constraint solving ⓘ formal methods ⓘ program verification ⓘ software model checking ⓘ symbolic execution ⓘ test-case generation ⓘ verification of hardware and protocols ⓘ |
| usedBy |
academic research projects
ⓘ
industrial verification workflows ⓘ software verification tools ⓘ |
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 SMT solver Description of subject: 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.
Referenced by (9)
Full triples — surface form annotated when it differs from this entity's canonical label.
linked to: Z3 SMT solver
linked to: Z3 SMT solver
subject linked to:
Satisfiability Modulo Theories (SMT)
linked to: Z3 SMT solver
linked to: Z3 SMT solver
subject linked to:
Python API