跳到正文
arXiv cs.AI· Amir Hossein Sharafi, Alireza Shahbazi·· 4 小时前AI 评分18

时序动态知识图谱上的交替溯因与规划

Alternating Abduction and Planning over Temporal Dynamic Knowledge Graphs

AI 导读

研究提出面向时序动态知识图谱(TDKG)的三种工具:时序投影用于精确检验规划,DDA 通过假设观测的否定并对推理器新推导结果取反来解释观测,APT 则从目标反向规划、假设计划所需但未陈述的事实并由 DDA 逐层解释为子目标。三者仅通过小型契约调用 SROIQ 推理器,不依赖特定推理器或数据结构,并在六个基准和五个推理器上取得一致结果。

正文 · 原文

View PDF HTML (experimental)

Abstract:Knowledge graphs change over time, but the effects of actions on them are only partly stated: the ontology entails further consequences, facts that an action needs are often unknown, and an action may make the graph inconsistent. We study these problems for Temporal Dynamic Knowledge Graphs (TDKGs), that is, SROIQ knowledge bases whose actions are rules with delete/insert templates and whose events lie on an intrinsic timeline. We present three tools: temporal projection, the exact test of plans; DDA (Direct-Derivation Abduction), which explains an observation by assuming its negation and negating what the reasoner newly derives; and APT (Abduction and Planning over TDKGs), which plans backwards from a goal, assumes the facts that the plan needs but nobody stated, and lets DDA explain the assumptions, each explanation becoming a sub-goal, up to a depth bound. The tools use a SROIQ reasoner only through a small contract, so they depend neither on a particular reasoner nor on a particular data structure; they are designed for a reasoner that processes added and removed axioms incrementally. Change is treated without modal operators, on one linear timeline and without possible worlds, so decidability of projection follows from that of SROIQ. We prove that indirect effects are exactly the entailments of the updated state, that DDA and APT are sound and terminate, and that bounded planning is 2NExpTime-hard and in 3ExpTime. We compare the tools with hitting-set abduction, the solver CATS and classical planning, and run them on six benchmarks and five reasoners with identical results.
Subjects: Artificial Intelligence (cs.AI); Logic in Computer Science (cs.LO)
Cite as: arXiv:2607.27287 [cs.AI]
  (or arXiv:2607.27287v4 [cs.AI] for this version)
  https://doi.org/10.48550/arXiv.2607.27287

arXiv-issued DOI via DataCite

Submission history

From: Amir Hossein Sharafi [view email]
[v1] Wed, 29 Jul 2026 14:44:46 UTC (37 KB)
[v2] Wed, 2 Sep 2026 14:50:41 UTC (35 KB)
[v3] Mon, 9 Nov 2026 08:05:25 UTC (81 KB)
[v4] Tue, 17 Nov 2026 07:07:06 UTC (91 KB)

来源:arXiv cs.AI · arxiv.org