A Strategy for Implementing description Temporal Dynamic Algorithms in Dynamic Knowledge Graphs by SPIN

TL;DR

The paper tackles the challenge of reasoning about actions and time in dynamic knowledge graphs by proposing the Borhan Dynamic Temporal Description (DTD) framework, which integrates actions into Description Logic via SPIN-based state-changing rules and discrete linear time. It defines a structured architecture with two reasoning components and four core services—Projection, Realizability, Executability, and Planning—tied together by a Time flow model $T=igl<T,<igr>$ and a point-based temporal DL model $M=(T,I)$. The work formalizes symbols, rules, and the notion of state-changers, and demonstrates how DP reasoning can be implemented as a Protégé plugin, addressing issues like the ramification problem and planning over multiple possible worlds. Complexity analyses show $O(n^2)$ for Projection and Executability, $O(n)$ for Realizability, and $O(n^d)$ for Planning, highlighting the framework’s scalability considerations. The authors also discuss future directions, including integration with abductive non-monotonic reasoning, non-individual-based TBox modelling, and embedding-based techniques for dynamic knowledge graphs, aiming to enhance practical applicability in dynamic semantic web environments.

Abstract

Planning and reasoning about actions and processes, in addition to reasoning about propositions, are important issues in recent logical and computer science studies. The widespread use of actions in everyday life such as IoT, semantic web services, etc., and the limitations and issues in the action formalisms are two factors that lead us to study how actions are represented. Since 2007, there have been some ideas to integrate Description Logic (DL) and action formalisms for representing both static and dynamic knowledge. Meanwhile, time is an important factor in dynamic situations, and actions change states over time. In this study, on the one hand, we examined related logical structures such as extensions of description logics (DLs), temporal formalisms, and action formalisms. On the other hand, we analyzed possible tools for designing and developing the Knowledge and Action Base (KAB). For representation and reasoning about actions, we embedded actions into DLs (such as Dynamic-ALC and its extensions). We propose a terminable algorithm for action projection, planning, checking the satisfiability, consistency, realizability, and executability, and also querying from KAB. Actions in this framework were modeled with SPIN and added to state space. This framework has also been implemented as a plugin for the Protégé ontology editor. During the last two decades, various algorithms have been presented, but due to the high computational complexity, we face many problems in implementing dynamic ontologies. In addition, an algorithm to detect the inconsistency of actions' effects was not explicitly stated. In the proposed strategy, the interactions of actions with other parts of modeled knowledge, and a method to check consistency between the effects of actions are presented. With this framework, the ramification problem can be well handled in future works.

Figures (2)

• Figure 1: Description and Temporal Dynamic Logic reasoner Components
• Figure 2: Temporal Dynamic Logic Services - Executability and Realizability Checker