Triple
T36789681
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | IC3 model checking algorithm |
E909016
|
entity |
| Predicate | instanceOf |
P0
|
FINISHED |
| Object | SAT-based model checking algorithm |
C26935
|
CONCEPT FINISHED |
How this triple was built (1 step)
Every LLM step that produced this triple, in pipeline order — named-entity classification, the disambiguation choices (the exact options shown, with the pick highlighted), and the generated description. The batch + timestamp of each is in the Provenance table below.
CD
Concept disambiguation
gpt-5-mini-2025-08-07
Target class: SAT-based model checking algorithm Context triple: [IC3 model checking algorithm, instanceOf, SAT-based model checking algorithm]
-
A.
method in Satisfiability Modulo Theories
A method in Satisfiability Modulo Theories is a procedure or algorithmic step used by an SMT solver to determine the satisfiability of logical formulas with respect to one or more background theories (such as arithmetic, arrays, or bit-vectors).
-
B.
model checking technique
chosen
A model checking technique is a formal verification method that systematically explores all possible states of a system model to automatically determine whether it satisfies specified correctness properties.
-
C.
SMT solver competition
An SMT solver competition is an organized event where different Satisfiability Modulo Theories solvers are benchmarked and compared on standardized problem sets to evaluate and advance the state of the art in automated reasoning.
-
D.
SAT solver
A SAT solver is a computational tool that determines whether there exists an assignment of truth values to variables that makes a given Boolean formula evaluate to true.
-
E.
logic for concurrent systems
Logic for concurrent systems is a formal framework for specifying and reasoning about the behaviors, interactions, and correctness properties of systems in which multiple processes execute and communicate simultaneously.
- F. None of above.
Provenance (1 batch)
The batch behind each pipeline step, in order, with when it ran. Timestamps are batch-level — stages were processed in waves, so the object chain (NER → NED1 → NEDg → NED2) reads in order, but predicate / elicitation batches can sit in a different wave.
| Step | Stage | Batch ID | Status | When |
|---|---|---|---|---|
| creating | Elicitation | batch_69f76e7a937c81909ed7359641e670f6 |
completed | May 3, 2026, 3:49 p.m. |
Created at: May 3, 2026, 4:12 p.m.