Temporal Reasoning with Abductive Logic Programming.
Richard Z. Li, Luı́s Moniz Pereira · 1996
In this paper we extend Gelfond and Lifschitz' action description language A with concurrent actions and give a new semantics to concurrent actions. In order to automate temporal reasoing we present a translation from domain descriptions in the resulting new action description language to abductive logic programs. The translation has been shown to be both sound and complete. Our method is applicable to the temporal projection problem with incomplete information, as well as to reasoning about the past. 1 INTRODUCTION In [11] Gelfond and Lifschitz proposed an action description language A and presented a translation from A to extended logic programs with answer sets as semantics [10], and proved its soundness. Kartha proposed three sound and complete translations of A into three formalisms of reasoning about actions proposed by Baker [2], Pednault [20], and Reiter [22], respectively. Kartha and Lifschitz [16] also considered how to deal with ramifications based on A by using nested abno...