Practical undoability checking via contingent planning

摘要: We consider a general concept of undoability, asking whether given action can always be undone, no matter which state it is applied to. This generalizes previous concepts invertibility, and relevant for search as well applications. Naive undoability checking requires to enumerate all states an applicable Extending operationalizing prior work in this direction, we introduce compilation into contingent planning, replacing such enumeration by standard techniques handling large belief states. furthermore compilations one get back at-least-as-good state, determining partial i. e., on subset Our experiments IPC benchmarks cloud management application show that planners are often effective at solving kind problem, hence providing practical means checking.