Daum, Jeanette; Torralba, Alvaro; Hoffmann, Jorg; Haslum, Patrik; Weber, Ingo
We consider a general concept of undoability, asking whether a given action can always be undone, no matter which state it is applied to. This generalizes previous concepts of invertibility, and is relevant for search as well as applications. Naïve undoability checking requires to enumerate all states an action is applicable to. Extending and operationalizing prior work in this direction, we introduce a compilation into contingent planning, replacing such enumeration by standard techniques...[Show more]
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.