Determining ActionReversibility in STRI...

In the context of planning and reasoning about actions and change, we call anaction reversible when its effects can be reverted by applying other actions,returning to the original state. Renewed interest in this area has led toseveral results in the context of the PDDL language, widely used for describingplanning tasks.

In this paper, we propose several solutions to the computational problem ofdeciding the reversibility of an action. In particular, we leverage an existingtranslation from PDDL to Answer Set Programming (ASP), and then use severaldifferent encodings to tackle the problem of action reversibility for theSTRIPS fragment of PDDL. For these, we use ASP, as well as Epistemic LogicProgramming (ELP), an extension of ASP with epistemic operators, and compareand contrast their strengths and weaknesses.

Under consideration for acceptance in TPLP.