# Determining ActionReversibility in STRIPS Using Answer Set and Epistemic Logic Programming

arXiv: https://arxiv.org/abs/2108.05428 · HTML: https://mlsanity.com/paper/2108.05428/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- Builds on 3 of its 30 references that are in the map.
- First posted on arXiv 11 Aug 2021.

## Builds on (most cited first, 3 of 3)

- [ASP-Core-2 Input Language Format](https://mlsanity.com/paper/1911.04326/) (2019)
- [eclingo: A solver for Epistemic Logic Programs](https://mlsanity.com/paper/2008.02018/) (2020)
- [plasp 3: Towards Effective ASP Planning](https://mlsanity.com/paper/1812.04491/) (2018)

## Built on by (most cited first, 1 of 1)

- [Solving Epistemic Logic Programs using Generate-and-Test with Propagation](https://mlsanity.com/paper/2410.22130/) (2024)

## Abstract (arXiv)

In the context of planning and reasoning about actions and change, we call an action reversible when its effects can be reverted by applying other actions, returning to the original state. Renewed interest in this area has led to several results in the context of the PDDL language, widely used for describing planning tasks. In this paper, we propose several solutions to the computational problem of deciding the reversibility of an action. In particular, we leverage an existing translation from PDDL to Answer Set Programming (ASP), and then use several different encodings to tackle the problem of action reversibility for the STRIPS fragment of PDDL. For these, we use ASP, as well as Epistemic Logic Programming (ELP), an extension of ASP with epistemic operators, and compare and contrast their strengths and weaknesses. Under consideration for acceptance in TPLP.