2026· Annual Meeting of the Association for Computational Linguistics· pp. 19113-19126· 0 citations· 29 references
Computer Science
TL;DR
ODL-TempLLM leverages ontology learning to explicitly construct structured temporal knowledge, employs a symbolic reasoner to deductively reason about temporal relations and uses logic-constrained retrieval augmentation to obtain relevant facts.
Abstract
Temporal reasoning is crucial for large language models (LLMs) to understand event concurrency and complex temporal interactions in natural language. Recent approaches rely on the LLM to infer temporal relations between events and largely overlook the inherent structural nature of temporal relationships. In this work, we propose ODL-TempLLM ( O ntology-Guided and D escription L ogic–Constrained Temp oral Reasoning with LLM s), a novel paradigm for temporal reasoning with LLMs that shifts focus from internal inference to the explicit modeling of temporal structure. ODL-TempLLM leverages ontology learning to explicitly construct structured temporal knowledge, employs a symbolic reasoner to deductively reason about temporal relations and uses logic-constrained retrieval augmentation to obtain relevant facts. Experiments re-sults evaluated across three datasets via various LLM backbones show that our method outperforms state-of-the-art methods by 2.07–31.83 F1 points and 1.00–30.73 EM points, exhibiting strong generalization and highlighting the potential of explicit temporal reasoning.
Temporal knowledge graph (TKG) reasoning is critical for modeling and forecasting the evolution of real-world events. Existing TKG construction pipelines transform raw text into structured temporal quadruples as graph facts. However, in this process, they often fail to preserve reasoning-relevant contextual semantics f...
Ze-Shu Tian, J. Tao, Hong-Li Zhang· Proceedings of the Thirty-Fi...· 0 citations
Results indicate that ontology-constrained LLM pipelines can support the formalization of engineering requirements into semantically explicit graph representations that are suitable for downstream querying, validation, and analysis.
A. Stefanone, M. Rossoni, Giorgio Colombo· Journal of Mechanical Design· 0 citations
SodaMem is presented, an evidence-grounded temporal graph memory that extracts typed FactEvents with mandatory provenance spans, persists mention time, occurrence time, and validity with SUPERSEDES/CONTRADICTS/UPDATES edges under hybrid lexical-dense indexing and answers via a planner-reader loop that gathers citable e...
OntoExpand is introduced, a new methodology for ontology expansion that uses SPARQL CONSTRUCT queries as an efficient alternative to conventional reasoning techniques that improves performance, reduces computational overhead, is pattern driven allowing a more granular expansion control and seamlessly integrates with SP...
Vitor Lelis, N. Leite, José Carlos et al.· 0 citations
MulTR, a comprehensive benchmark designed for multi-answer temporal reasoning from long unstructured contexts, is introduced, designed to systematically decouple temporal reasoning capabilities from the uncertainty of the number of answers.
Shaojuan Wu· Annual International ACM SIG...· 0 citations
OaK is presented, an ontology-as-a-kernel framework that dynamically constructs and refines task-oriented ontologies for LLM agents and shows that OaK improves standard LLM agents, strengthens evidence grounding, and boosts the reliability of multi-step reasoning.
Xiaohui Zhang, Ze-Qun Sun, Cheng Yang et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.