Determining Action Reversibility in STR...

Abstract. In planning and reasoning about action and change, reversibility of actions is the problem of deciding whether the effects of an actioncan be reverted by applying other actions in order to return to the original state. While this problem has been studied for some time, recentlythere as been renewed interest in the context of the language PDDL.After reviewing the concepts, in this paper we propose a solution byleveraging an existing translation from PDDL to Answer Set Programming (ASP), which we then use to solve the problem via epistemic logicprograms (ELPs). This work provides a sound and complete system fordetermining reversibility of PDDL actions (restricted to the STRIPSfragment), while also providing insight into the performance of state-ofthe-art ELP solvers.