2021/08/11 by Wolfgang Faber, Faber, Wolfgang, Michael Morak +3
Computer Science · #Artificial Intelligence (cs.AI) #FOS: Computer and information sciences #Logic, Reasoning, and Knowledge #Logic, programming, and type systems #Multi-Agent Systems and Negotiation
paper · pdf · doi:10.48550/arxiv.2108.05428
openalex publication_date 2021/08/11 · openalex created_date 2022/07/25 · openalex updated_date 2026/07/28
In the context of planning and reasoning about actions and change, we call an\naction reversible when its effects can be reverted by applying other actions,\nreturning to the original state. Renewed interest in this area has led to\nseveral results in the context of the PDDL language, widely used for describing\nplanning tasks.\n In this paper, we propose several solutions to the computational problem of\ndeciding the reversibility of an action. In particular, we leverage an existing\ntranslation from PDDL to Answer Set Programming (ASP), and then use several\ndifferent encodings to tackle the problem of action reversibility for the\nSTRIPS fragment of PDDL. For these, we use ASP, as well as Epistemic Logic\nProgramming (ELP), an extension of ASP with epistemic operators, and compare\nand contrast their strengths and weaknesses.\n Under consideration for acceptance in TPLP.\n