Triple
T4443709
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | CSP (Communicating Sequential Processes) |
E96229
|
entity |
| Predicate | hasToolSupport |
P9867
|
FINISHED |
| Object |
FDR model checker
FDR model checker is a refinement-based verification tool used to analyze and prove properties of systems specified in the Communicating Sequential Processes (CSP) formalism.
|
E440674
|
NE FINISHED |
How this triple was built (5 steps)
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.
NER
Named-entity recognition
gpt-5-mini
Instruction
Given a phrase, classify it is english named entity (e.g., persons, organizations, works of art) in Latin script, or not (e.g., literals, dates, URLs, verbose phrases). For disambiguation, the statement where the phrase occurs as object is also given. Please return a JSON object with `phrase` (string, the phrase being analyzed) and `is_ne` (boolean, indicating whether the phrase is a Named Entity).
Input
Phrase: FDR model checker | Statement: [CSP (Communicating Sequential Processes), hasToolSupport, FDR model checker]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: FDR model checker Context triple: [CSP (Communicating Sequential Processes), hasToolSupport, FDR model checker]
-
A.
Model Checking (book)
"Model Checking" is a foundational textbook that systematically presents the theory and practice of using automated verification techniques to prove correctness properties of hardware and software systems.
-
B.
Symbolic Model Checking
Symbolic Model Checking is a formal verification technique that uses symbolic representations, such as binary decision diagrams, to efficiently verify properties of hardware and software systems with very large state spaces.
-
C.
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.
-
D.
Temporal Verification of Reactive Systems
"Temporal Verification of Reactive Systems" is a foundational book in formal methods that presents rigorous techniques for specifying and verifying the correctness of reactive and concurrent systems using temporal logic.
-
E.
branching-time temporal logic CTL*
Branching-time temporal logic CTL* is a highly expressive formalism in computer science used to specify and reason about the behavior of concurrent and reactive systems over branching time structures.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NEDg
Description generation
gpt-5.1
Instruction
Generate a one-sentence description of the target entity. You are given a context triple in the form (subject, predicate, object), where the object is the target entity. # Instructions Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. Avoid repeating the information from the triple, unless really essential. # Response Format Return only the sentence: "Description: [one-sentence description of the target entity]"
Input
Entity: FDR model checker Triple: [CSP (Communicating Sequential Processes), hasToolSupport, FDR model checker]
Generated description
FDR model checker is a refinement-based verification tool used to analyze and prove properties of systems specified in the Communicating Sequential Processes (CSP) formalism.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: FDR model checker Target entity description: FDR model checker is a refinement-based verification tool used to analyze and prove properties of systems specified in the Communicating Sequential Processes (CSP) formalism.
-
A.
Model Checking (book)
"Model Checking" is a foundational textbook that systematically presents the theory and practice of using automated verification techniques to prove correctness properties of hardware and software systems.
-
B.
Symbolic Model Checking
Symbolic Model Checking is a formal verification technique that uses symbolic representations, such as binary decision diagrams, to efficiently verify properties of hardware and software systems with very large state spaces.
-
C.
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.
-
D.
Temporal Verification of Reactive Systems
"Temporal Verification of Reactive Systems" is a foundational book in formal methods that presents rigorous techniques for specifying and verifying the correctness of reactive and concurrent systems using temporal logic.
-
E.
branching-time temporal logic CTL*
Branching-time temporal logic CTL* is a highly expressive formalism in computer science used to specify and reason about the behavior of concurrent and reactive systems over branching time structures.
- F. None of above. chosen
PD
Predicate disambiguation
gpt-5-mini-2025-08-07
Target predicate: hasToolSupport Context triple: [CSP (Communicating Sequential Processes), hasToolSupport, FDR model checker]
-
A.
hasSupported
Indicates that one entity has provided assistance, endorsement, or backing to another entity, either materially, emotionally, or through advocacy.
-
B.
hasTypeOfSupport
Indicates that one entity provides or is associated with a particular kind or category of support in relation to another entity.
-
C.
usesToolType
Indicates that an entity performs an action or fulfills a role by employing a specific type or category of tool.
-
D.
hasFeature
Indicates that an entity possesses, exhibits, or includes a particular characteristic, attribute, or component.
-
E.
isSupportedBy
chosen
Indicates that an entity is upheld, sustained, or enabled by another entity, which provides necessary assistance, resources, or justification.
- F. None of above.
Provenance (6 batches)
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_69b345415ba481908df738e7174448ba |
completed | March 12, 2026, 10:59 p.m. |
| NER | Named-entity recognition | batch_69b355b052688190a0d8e5912f82151c |
completed | March 13, 2026, 12:09 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69b61382d00481908b7c84f337b5cad7 |
completed | March 15, 2026, 2:03 a.m. |
| NEDg | Description generation | batch_69b6177d1a588190991fddf506239d22 |
completed | March 15, 2026, 2:20 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69b61b6bc1448190b30d444a821bb1a5 |
completed | March 15, 2026, 2:37 a.m. |
| PD | Predicate disambiguation | batch_69b34f62c180819097ced38da2052207 |
completed | March 12, 2026, 11:42 p.m. |
Created at: March 12, 2026, 11:32 p.m.