Yices
E904160
Yices is a high-performance Satisfiability Modulo Theories (SMT) solver widely used in formal verification and automated reasoning.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Yices canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T11090189 — 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: Yices Context triple: [Satisfiability Modulo Theories, hasSolver, Yices]
-
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.
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.
-
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.
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: Yices Target entity description: Yices is a high-performance Satisfiability Modulo Theories (SMT) solver widely used in formal verification and automated reasoning.
-
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.
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.
-
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.
Maxima
Maxima is the first daughter of Facebook co-founder Mark Zuckerberg and philanthropist Priscilla Chan.
- F. None of above. chosen
Statements (44)
| Predicate | Object |
|---|---|
| instanceOf |
SMT solver
ⓘ
decision procedure ⓘ formal verification tool ⓘ software tool ⓘ |
| conformsTo | SMT-LIB standard NERFINISHED ⓘ |
| hasDeveloper |
SRI International
NERFINISHED
ⓘ
SRI International Computer Science Laboratory NERFINISHED ⓘ |
| hasHomepage | https://yices.csl.sri.com/ ⓘ |
| hasLicense | proprietary with free academic use ⓘ |
| hasProperty |
high-performance
ⓘ
industrial-strength ⓘ supports multiple background theories ⓘ |
| hasVersion |
Yices 1
NERFINISHED
ⓘ
Yices 2 NERFINISHED ⓘ |
| isDesignedFor |
automated reasoning
ⓘ
formal verification ⓘ hardware verification ⓘ model checking ⓘ software verification ⓘ |
| isNamedAfter | Yices (proper name used by SRI International) NERFINISHED ⓘ |
| isUsedIn |
formal methods research
ⓘ
industrial verification workflows ⓘ |
| isWrittenInLanguage | C NERFINISHED ⓘ |
| participatesIn | SMT-COMP NERFINISHED ⓘ |
| runsOn |
Linux
ⓘ
Windows NERFINISHED ⓘ macOS NERFINISHED ⓘ |
| supportsFeature |
incremental solving
ⓘ
model generation ⓘ optimization for some theories ⓘ push-pop interface ⓘ unsat core extraction ⓘ |
| supportsInterface |
C API
NERFINISHED
ⓘ
C++ API NERFINISHED ⓘ Python bindings ⓘ SMT-LIB format ⓘ command-line interface ⓘ |
| supportsLogic |
Satisfiability Modulo Theories
NERFINISHED
ⓘ
arrays ⓘ bit-vectors ⓘ combinations of theories ⓘ equality with uninterpreted functions ⓘ quantifier-free linear arithmetic ⓘ uninterpreted functions ⓘ |
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: Yices Description of subject: Yices is a high-performance Satisfiability Modulo Theories (SMT) solver widely used in formal verification and automated reasoning.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.
subject surface form:
Satisfiability Modulo Theories