Triple

T10733086
Position Surface form Disambiguated ID Type / Status
Subject Leibnizian logic E253121 entity
Predicate relatedTo P37 FINISHED
Object Boolean algebra
Boolean algebra is a branch of algebraic logic that studies variables and operations based on two values, typically true and false, forming the mathematical foundation of digital circuits and classical logic.
E883488 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: Boolean algebra | Statement: [Leibnizian logic, relatedTo, Boolean algebra]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Boolean algebra
Context triple: [Leibnizian logic, relatedTo, Boolean algebra]
  • A. De Morgan's laws
    De Morgan's laws are fundamental rules in Boolean algebra and set theory that relate conjunctions and disjunctions through negation, forming a cornerstone of classical logic.
  • B. Kleene algebra
    Kleene algebra is an algebraic structure used to model and reason about regular expressions, program control flow, and formal languages through operations like choice, sequencing, and iteration.
  • C. OBDDs
    OBDDs (Ordered Binary Decision Diagrams) are a canonical, graph-based representation of Boolean functions that enables efficient manipulation and verification in formal methods and model checking.
  • D. A Symbolic Analysis of Relay and Switching Circuits
    A Symbolic Analysis of Relay and Switching Circuits is Claude Shannon’s landmark 1937 master’s thesis that founded modern digital circuit design by applying Boolean algebra to relay and switching systems.
  • E. Description Logic
    Description Logic is a family of formal knowledge representation languages used to model and reason about the concepts and relationships within a domain, forming the logical foundation of ontology languages like OWL.
  • 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: Boolean algebra
Triple: [Leibnizian logic, relatedTo, Boolean algebra]
Generated description
Boolean algebra is a branch of algebraic logic that studies variables and operations based on two values, typically true and false, forming the mathematical foundation of digital circuits and classical logic.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Boolean algebra
Target entity description: Boolean algebra is a branch of algebraic logic that studies variables and operations based on two values, typically true and false, forming the mathematical foundation of digital circuits and classical logic.
  • A. De Morgan's laws
    De Morgan's laws are fundamental rules in Boolean algebra and set theory that relate conjunctions and disjunctions through negation, forming a cornerstone of classical logic.
  • B. Kleene algebra
    Kleene algebra is an algebraic structure used to model and reason about regular expressions, program control flow, and formal languages through operations like choice, sequencing, and iteration.
  • C. OBDDs
    OBDDs (Ordered Binary Decision Diagrams) are a canonical, graph-based representation of Boolean functions that enables efficient manipulation and verification in formal methods and model checking.
  • D. A Symbolic Analysis of Relay and Switching Circuits
    A Symbolic Analysis of Relay and Switching Circuits is Claude Shannon’s landmark 1937 master’s thesis that founded modern digital circuit design by applying Boolean algebra to relay and switching systems.
  • E. Description Logic
    Description Logic is a family of formal knowledge representation languages used to model and reason about the concepts and relationships within a domain, forming the logical foundation of ontology languages like OWL.
  • 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_69d6aa5d8be481909a43218b2bfdbe95 completed April 8, 2026, 7:19 p.m.
NER Named-entity recognition batch_69d7101ff9808190a27fcc06da097ea3 completed April 9, 2026, 2:34 a.m.
NED1 Entity disambiguation (via context triple) batch_69de22bb62e481909544c87801012df3 completed April 14, 2026, 11:19 a.m.
NEDg Description generation batch_69de271ca4f081908d78a20b25ebd25c completed April 14, 2026, 11:38 a.m.
NED2 Entity disambiguation (via description) batch_69de2ccee0cc8190acd24d5c225f7cde completed April 14, 2026, 12:02 p.m.
Created at: April 8, 2026, 9:14 p.m.