Triple

T11090201
Position Surface form Disambiguated ID Type / Status
Subject Satisfiability Modulo Theories E262229 entity
Predicate relatedTo P37 FINISHED
Object Shostak combination method
The Shostak combination method is a decision procedure framework in automated reasoning that efficiently combines theories with disjoint signatures to solve satisfiability problems in Satisfiability Modulo Theories (SMT).
 E904164 NE FINISHED

Named-entity recognition

Before disambiguation, gpt-5-mini classified whether the object phrase is a named entity — the step behind the object's NE type shown above.

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: Shostak combination method | Statement: [Satisfiability Modulo Theories, relatedTo, Shostak combination method]

Disambiguation candidates (2 decisions)

The exact options the model was shown at each disambiguation step, with the option it chose highlighted — the evidence behind this triple's disambiguated ids.

NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Shostak combination method
Context triple: [Satisfiability Modulo Theories, relatedTo, Shostak combination method]
  • A. Bailey chain method
    The Bailey chain method is a powerful technique in the theory of basic hypergeometric series that systematically generates infinite families of q-series and partition identities, including generalizations of Rogers–Ramanujan-type identities.
  • B. Gundersen method
    The Gundersen method is a timing-based system in Nordic combined that converts ski jumping results into staggered start times for the cross-country race so that the first athlete to finish wins overall.
  • C. O’Connor Method
    The O’Connor Method is a string instrument teaching system that emphasizes American folk, jazz, and classical styles to develop musicality and improvisation in students.
  • D. Darwin–Fowler method
    The Darwin–Fowler method is a statistical mechanics technique that uses complex analysis and generating functions to derive distribution laws for systems of many particles.
  • E. Gregory method
    The Gregory method is a numerical integration technique that approximates definite integrals using a series expansion based on finite differences.
  • F. None of above. chosen
  • G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07 
Target entity: Shostak combination method
Target entity description: The Shostak combination method is a decision procedure framework in automated reasoning that efficiently combines theories with disjoint signatures to solve satisfiability problems in Satisfiability Modulo Theories (SMT).
  • A. Bailey chain method
    The Bailey chain method is a powerful technique in the theory of basic hypergeometric series that systematically generates infinite families of q-series and partition identities, including generalizations of Rogers–Ramanujan-type identities.
  • B. Gundersen method
    The Gundersen method is a timing-based system in Nordic combined that converts ski jumping results into staggered start times for the cross-country race so that the first athlete to finish wins overall.
  • C. O’Connor Method
    The O’Connor Method is a string instrument teaching system that emphasizes American folk, jazz, and classical styles to develop musicality and improvisation in students.
  • D. Darwin–Fowler method
    The Darwin–Fowler method is a statistical mechanics technique that uses complex analysis and generating functions to derive distribution laws for systems of many particles.
  • E. Gregory method
    The Gregory method is a numerical integration technique that approximates definite integrals using a series expansion based on finite differences.
  • F. None of above. chosen

How the object was described

The object's one-sentence description was generated by prompting gpt-5.1 with the object name and this triple as context.

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: Shostak combination method
Triple: [Satisfiability Modulo Theories, relatedTo, Shostak combination method]
Generated description
The Shostak combination method is a decision procedure framework in automated reasoning that efficiently combines theories with disjoint signatures to solve satisfiability problems in Satisfiability Modulo Theories (SMT).

Provenance (5 batches)

Stage Batch ID Job type Status
creating batch_69d6aa9a40d88190a373e2c7e48285db elicitation completed
NER batch_69d799e96ca08190838c8a04d1eb2a16 ner completed
NED1 batch_69e3e7c586808190a576803b7406a49e ned_source_triple completed
NED2 batch_69e3f488819081908f9a4225279cde6b ned_description completed
NEDg batch_69e3f2cafc008190a3504999297f1e4e nedg completed
Created at: April 8, 2026, 9:27 p.m.