Triple
T2139675
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Tobias Nipkow |
E46732
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object |
Isabelle/HOL: A Proof Assistant for Higher-Order Logic
"Isabelle/HOL: A Proof Assistant for Higher-Order Logic" is a foundational book and system documentation that presents the Isabelle/HOL interactive theorem prover, widely used for formal verification and higher-order logic reasoning in computer science and mathematics.
|
E238246
|
NE FINISHED |
How this triple was built (4 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: Isabelle/HOL: A Proof Assistant for Higher-Order Logic | Statement: [Tobias Nipkow, notableWork, Isabelle/HOL: A Proof Assistant for Higher-Order Logic]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Isabelle/HOL: A Proof Assistant for Higher-Order Logic Context triple: [Tobias Nipkow, notableWork, Isabelle/HOL: A Proof Assistant for Higher-Order Logic]
-
A.
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.
-
B.
Hoare logic
Hoare logic is a formal system in computer science used to reason rigorously about the correctness of computer programs using logical assertions about program states.
-
C.
The Definition of Standard ML
The Definition of Standard ML is the formal language specification that rigorously defines the syntax and semantics of the Standard ML functional programming language.
-
D.
Hindley–Milner type system
The Hindley–Milner type system is a classical polymorphic type system used in many functional programming languages, notable for enabling type inference without explicit type annotations.
-
E.
CCS (Calculus of Communicating Systems)
CCS (Calculus of Communicating Systems) is a formal process calculus introduced by Robin Milner for modeling, specifying, and reasoning about concurrent, communicating systems in computer science.
- 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: Isabelle/HOL: A Proof Assistant for Higher-Order Logic Triple: [Tobias Nipkow, notableWork, Isabelle/HOL: A Proof Assistant for Higher-Order Logic]
Generated description
"Isabelle/HOL: A Proof Assistant for Higher-Order Logic" is a foundational book and system documentation that presents the Isabelle/HOL interactive theorem prover, widely used for formal verification and higher-order logic reasoning in computer science and mathematics.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Isabelle/HOL: A Proof Assistant for Higher-Order Logic Target entity description: "Isabelle/HOL: A Proof Assistant for Higher-Order Logic" is a foundational book and system documentation that presents the Isabelle/HOL interactive theorem prover, widely used for formal verification and higher-order logic reasoning in computer science and mathematics.
-
A.
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.
-
B.
Hoare logic
Hoare logic is a formal system in computer science used to reason rigorously about the correctness of computer programs using logical assertions about program states.
-
C.
The Definition of Standard ML
The Definition of Standard ML is the formal language specification that rigorously defines the syntax and semantics of the Standard ML functional programming language.
-
D.
Hindley–Milner type system
The Hindley–Milner type system is a classical polymorphic type system used in many functional programming languages, notable for enabling type inference without explicit type annotations.
-
E.
CCS (Calculus of Communicating Systems)
CCS (Calculus of Communicating Systems) is a formal process calculus introduced by Robin Milner for modeling, specifying, and reasoning about concurrent, communicating systems in computer science.
- F. None of above. chosen
Provenance (5 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_69a88a174ab48190a5db20c132e5dccf |
completed | March 4, 2026, 7:37 p.m. |
| NER | Named-entity recognition | batch_69abbe025d3c81908bcb33a7ff09eae8 |
completed | March 7, 2026, 5:56 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69ae51b1290c8190a08850b428c99a6c |
completed | March 9, 2026, 4:50 a.m. |
| NEDg | Description generation | batch_69ae55923b748190bf7a2df3ae94edc8 |
completed | March 9, 2026, 5:07 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69ae55fdc32c8190b6ecdc9b23d64cc5 |
completed | March 9, 2026, 5:09 a.m. |
Created at: March 4, 2026, 7:44 p.m.