CVC4
E904159
CVC4 is an open-source automated theorem prover and SMT (Satisfiability Modulo Theories) solver used for verifying logical formulas across a variety of theories such as arithmetic, bit-vectors, arrays, and datatypes.
All labels observed (2)
| Label | Occurrences |
|---|---|
| CVC4 canonical | 3 |
| CVC4 SMT solver | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T11090187 — 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: CVC4 Context triple: [Satisfiability Modulo Theories, hasSolver, CVC4]
-
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.
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.
-
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.
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.
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.
- 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: CVC4 Target entity description: CVC4 is an open-source automated theorem prover and SMT (Satisfiability Modulo Theories) solver used for verifying logical formulas across a variety of theories such as arithmetic, bit-vectors, arrays, and datatypes.
-
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.
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.
-
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.
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.
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.
- F. None of above. chosen
Statements (50)
| Predicate | Object |
|---|---|
| instanceOf |
SMT solver
ⓘ
automated theorem prover ⓘ formal verification tool ⓘ open-source software ⓘ |
| hasCommandLineInterface | yes ⓘ |
| hasDeveloper |
Aaron Stump
ⓘ
Andrew Reynolds ⓘ Cesare Tinelli ⓘ Clark Barrett ⓘ Morgan Deters ⓘ other contributors ⓘ |
| hasProgrammingLanguageBinding |
C
ⓘ
C++ ⓘ Java ⓘ Python ⓘ |
| hasWebsite | https://cvc4.github.io ⓘ |
| implementsStandard | SMT-LIB language ⓘ |
| isPredecessorOf |
cvc5
ⓘ
linked to:
CVC5
|
| isSuccessorOf | CVC3 ⓘ |
| isWrittenInProgrammingLanguage | C++ ⓘ |
| license | BSD-style license ⓘ |
| participatesIn | SMT-COMP ⓘ |
| repository | https://github.com/CVC4/CVC4 ⓘ |
| supportsFeature |
incremental solving
ⓘ
interpolant generation ⓘ model generation ⓘ proof production ⓘ unsat core generation ⓘ |
| supportsInputFormat |
SMT-LIB v2
ⓘ
linked to:
SMT-LIB2
its own native formats ⓘ |
| supportsLogic |
first-order logics with quantifiers
ⓘ
many SMT-LIB logics ⓘ quantifier-free logics ⓘ |
| supportsTheory |
arithmetic
ⓘ
arrays ⓘ bags ⓘ bit-vectors ⓘ datatypes ⓘ floating-point arithmetic ⓘ linear arithmetic ⓘ nonlinear arithmetic ⓘ quantifiers ⓘ sets ⓘ uninterpreted functions ⓘ |
| usedFor |
constraint solving
ⓘ
hardware verification ⓘ model checking ⓘ program analysis ⓘ software verification ⓘ synthesis ⓘ |
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: CVC4 Description of subject: CVC4 is an open-source automated theorem prover and SMT (Satisfiability Modulo Theories) solver used for verifying logical formulas across a variety of theories such as arithmetic, bit-vectors, arrays, and datatypes.
Referenced by (4)
Full triples — surface form annotated when it differs from this entity's canonical label.