Triple

T6370859
Position Surface form Disambiguated ID Type / Status
Subject LambdaProlog E143339 entity
Predicate influenced P9 FINISHED
Object Twelf
Twelf is a logical framework and meta-logical tool used for specifying, implementing, and proving properties of deductive systems such as programming languages and logics.
E588090 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: Twelf | Statement: [LambdaProlog, influenced, Twelf]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Twelf
Context triple: [LambdaProlog, influenced, Twelf]
  • 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. Isabelle proof assistant
    Isabelle proof assistant is a widely used interactive theorem prover and generic proof assistant designed for formal verification and mathematical logic, particularly known for its support of higher-order logic.
  • C. 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.
  • D. 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.
  • E. ACL2 theorem proving system
    The ACL2 theorem proving system is an automated reasoning tool and programming language based on a subset of Common Lisp, widely used for modeling and mechanically verifying hardware, software, and mathematical theorems.
  • 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: Twelf
Triple: [LambdaProlog, influenced, Twelf]
Generated description
Twelf is a logical framework and meta-logical tool used for specifying, implementing, and proving properties of deductive systems such as programming languages and logics.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Twelf
Target entity description: Twelf is a logical framework and meta-logical tool used for specifying, implementing, and proving properties of deductive systems such as programming languages and logics.
  • 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. Isabelle proof assistant
    Isabelle proof assistant is a widely used interactive theorem prover and generic proof assistant designed for formal verification and mathematical logic, particularly known for its support of higher-order logic.
  • C. 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.
  • D. 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.
  • E. ACL2 theorem proving system
    The ACL2 theorem proving system is an automated reasoning tool and programming language based on a subset of Common Lisp, widely used for modeling and mechanically verifying hardware, software, and mathematical theorems.
  • 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_69c008d8c61081908bcaf61510d881ed completed March 22, 2026, 3:20 p.m.
NER Named-entity recognition batch_69c068277f6c81908e6a55e006f0c229 completed March 22, 2026, 10:07 p.m.
NED1 Entity disambiguation (via context triple) batch_69c62d8bce3481909b0bf7533b330d1f completed March 27, 2026, 7:11 a.m.
NEDg Description generation batch_69c62e2072808190a4f2dd262b631c88 completed March 27, 2026, 7:13 a.m.
NED2 Entity disambiguation (via description) batch_69c62f1bbdac8190b0cff9fbcddd68a7 completed March 27, 2026, 7:17 a.m.
Created at: March 22, 2026, 4:33 p.m.