Towards an Expressive Decidable Logical Action Theory

2012 International Workshop on Description Logics

Wael Yehia ; Mikhail Soutchanski

Others  :  http://ceur-ws.org/Vol-846/paper_9.pdf

来源: CEUR

【 摘 要 】

The projection problem is an important reasoning task in AI. It is a prerequisite to solving other computational problems including planning and high-level program execution. Informally, the projection problem consists in finding whether a given logical formula is true in a state that results from a sequence of transitions, when knowledge about an initial state is incomplete. In description logics (DLs) and earlier terminological systems, this problem was formulated using roles to represent transitions and concept expressions to represent states. This line of research as well as earlier applications of DLs to planning and plan recognition are discussed and reviewed in [5, 11] to mention a few only. Using a somewhat related approach, the projection problem and a solution to the related frame problem (i.e., how to provide a concise axiomatization of non-effects of actions) have been explored using propositional dynamic logic, e.g., see[10, 9]. These papers discuss relations with the propositional fragment of the situation calculus and review previous work. A more recent work explores decidable combinations of several modal logics, or combining description logics with a modal logic of time or with a propositional dynamic logic [1, 23, 7]. The resulting logics are somewhat limited in terms of expressivity because to guarantee the decidability of the satisfiabilityproblem in the combined logic, only atomic actions can be allowed. In applications, it is sometimes convenient to consider actions with arbitrary many arguments.[First Paragraph]