{'fraction_non_alphanumeric': 0.019836639439906652, 'fraction_numerical': 0.0, 'mean_word_length': 5.085106382978723, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Determining Action Reversibility in STRIPS Using Epistemic Logic Programs

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