Triple
T12207012
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Logical Methods in Computer Science |
E290860
|
entity |
| Predicate | hasAbbreviation |
P43
|
FINISHED |
| Object | LMCS |
E290860
|
NE FINISHED |
How this triple was built (2 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: LMCS | Statement: [Logical Methods in Computer Science, hasAbbreviation, LMCS]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: LMCS Context triple: [Logical Methods in Computer Science, hasAbbreviation, LMCS]
-
A.
CLCS
CLCS is a United Nations body of experts that evaluates and makes recommendations on coastal states’ claims to the outer limits of their continental shelves under the UN Convention on the Law of the Sea.
-
B.
Logical Methods in Computer Science
chosen
Logical Methods in Computer Science is a peer-reviewed open-access journal focusing on theoretical computer science, particularly logic and its applications to computer science.
-
C.
"Logic for Computer Science: Foundations of Automatic Theorem Proving"
"Logic for Computer Science: Foundations of Automatic Theorem Proving" is a textbook that introduces the logical foundations and practical techniques underlying automated theorem proving and its applications in computer science.
-
D.
IEEE Technical Committee on Mathematical Foundations of Computing
The IEEE Technical Committee on Mathematical Foundations of Computing is a professional body within the IEEE that focuses on theoretical computer science and the mathematical underpinnings of computing.
-
E.
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.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Provenance (3 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_69d6ab65923081909acfc61b7a612233 |
completed | April 8, 2026, 7:24 p.m. |
| NER | Named-entity recognition | batch_69d91c7d8f5c8190a46e9caa2a920fa9 |
completed | April 10, 2026, 3:51 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69f60a9ae3d48190a220ccd37ce8d3e7 |
completed | May 2, 2026, 2:30 p.m. |
Created at: April 8, 2026, 9:51 p.m.