{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T09:43:34Z","timestamp":1762508614091,"version":"3.40.5"},"reference-count":21,"publisher":"Cambridge University Press (CUP)","issue":"5","license":[{"start":{"date-parts":[[2021,9,27]],"date-time":"2021-09-27T00:00:00Z","timestamp":1632700800000},"content-version":"unspecified","delay-in-days":26,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["cambridge.org"],"crossmark-restriction":true},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2021,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>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.<\/jats:p>","DOI":"10.1017\/s1471068421000429","type":"journal-article","created":{"date-parts":[[2021,9,27]],"date-time":"2021-09-27T14:30:35Z","timestamp":1632753035000},"page":"646-662","update-policy":"https:\/\/doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":4,"title":["Determining Action Reversibility in STRIPS Using Answer Set and Epistemic Logic Programming"],"prefix":"10.1017","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0330-5868","authenticated-orcid":false,"given":"WOLFGANG","family":"FABER","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2077-7672","authenticated-orcid":false,"given":"MICHAEL","family":"MORAK","sequence":"additional","affiliation":[]},{"given":"LUK\u00c1\u0160","family":"CHRPA","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2021,9,27]]},"reference":[{"key":"S1471068421000429_ref4","doi-asserted-by":"publisher","DOI":"10.24963\/kr.2021\/63"},{"key":"S1471068421000429_ref19","unstructured":"Lipovetzky, N. , Muise, C. J. and Geffner, H. 2016. Traps, invariants, and dead-ends. In Proc. ICAPS. 211\u2013215."},{"key":"S1471068421000429_ref10","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068418000583"},{"key":"S1471068421000429_ref14","doi-asserted-by":"crossref","unstructured":"Fikes, R. and Nilsson, N. J. 1971. STRIPS: A new approach to the application of theorem proving to problem solving. Artificial Intelligence 2, 3\/4, 189\u2013208.","DOI":"10.1016\/0004-3702(71)90010-5"},{"key":"S1471068421000429_ref18","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139583923","volume-title":"Automated Planning and Acting","author":"Ghallab","year":"2016"},{"key":"S1471068421000429_ref12","doi-asserted-by":"publisher","DOI":"10.1007\/BF01536399"},{"key":"S1471068421000429_ref20","doi-asserted-by":"publisher","DOI":"10.24963\/kr.2020\/65"},{"key":"S1471068421000429_ref3","unstructured":"Chrpa, L. , Faber, W. , Fi\u0161er, D. and Morak, M. 2020. Determining action reversibility in strips using answer set programming. In International Conference on Logic Programming 2020 Workshop Proceedings. CEUR Workshop Proceedings, vol. 2678."},{"key":"S1471068421000429_ref8","unstructured":"Daum, J. , Torralba, \u00c1. , Hoffmann, J. , Haslum, P. and Weber, I. 2016. Practical undoability checking via contingent planning. In Proc. ICAPS, 106\u2013114."},{"key":"S1471068421000429_ref2","doi-asserted-by":"crossref","unstructured":"Camacho, A. , Muise, C. J. and McIlraith, S. A. 2016. From FOND to robust probabilistic planning: Computing compact policies that bypass avoidable deadends. In Proc. ICAPS. 65\u201369.","DOI":"10.1609\/icaps.v26i1.13773"},{"key":"S1471068421000429_ref7","unstructured":"Cserna, B. , Doyle, W. J. , Ramsdell, J. S. and Ruml, W. 2018. Avoiding dead ends in real-time heuristic search. In Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, (AAAI-18), 1306\u20131313."},{"key":"S1471068421000429_ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.jal.2007.05.002"},{"key":"S1471068421000429_ref21","doi-asserted-by":"crossref","unstructured":"Truszczynski, M. 2011. Revisiting epistemic specifications. In Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning - Essays Dedicated to Michael Gelfond on the Occasion of His 65th Birthday, M. Balduccini and T. C. Son, Eds. Lecture Notes in Computer Science, vol. 6565. Springer, 315\u2013333.","DOI":"10.1007\/978-3-642-20832-4_20"},{"key":"S1471068421000429_ref15","unstructured":"Gelfond, M. 1991. Strong introspection. In Proc. AAAI, T. L. Dean and K. R. McKeown, Eds. AAAI Press\/The MIT Press, 386\u2013391."},{"key":"S1471068421000429_ref6","doi-asserted-by":"crossref","unstructured":"Chrpa, L. , McCluskey, T. L. and Osborne, H. 2012. Optimizing plans through analysis of action dependencies and independencies. In Proc. ICAPS.","DOI":"10.1609\/icaps.v22i1.13536"},{"key":"S1471068421000429_ref13","unstructured":"Faber, W. and Morak, M. 2020. Determining action reversibility in STRIPS using epistemic logic programs. In International Conference on Logic Programming 2020 Workshop Proceedings. CEUR Workshop Proceedings, vol. 2678."},{"key":"S1471068421000429_ref1","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(94)90081-7"},{"volume-title":"Automated Planning - Theory and Practice","year":"2004","author":"Ghallab","key":"S1471068421000429_ref17"},{"key":"S1471068421000429_ref5","doi-asserted-by":"crossref","unstructured":"Chrpa, L. , Lipovetzky, N. and Sardi\u00f1a, S. 2017. Handling non-local dead-ends in agent planning programs. In Proc. IJCAI, 971\u2013978.","DOI":"10.24963\/ijcai.2017\/135"},{"key":"S1471068421000429_ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2015.10.001"},{"key":"S1471068421000429_ref16","doi-asserted-by":"crossref","unstructured":"Gelfond, M. and Lifschitz, V. 1991. Classical negation in logic programs and disjunctive databases. New Generation Computing 9, 3\/4, 365\u2013386.","DOI":"10.1007\/BF03037169"}],"container-title":["Theory and Practice of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1471068421000429","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T08:05:59Z","timestamp":1673337959000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068421000429\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9]]},"references-count":21,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2021,9]]}},"alternative-id":["S1471068421000429"],"URL":"https:\/\/doi.org\/10.1017\/s1471068421000429","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"type":"print","value":"1471-0684"},{"type":"electronic","value":"1475-3081"}],"subject":[],"published":{"date-parts":[[2021,9]]},"assertion":[{"value":"\u00a9 The Author(s), 2021. Published by Cambridge University Press","name":"copyright","label":"Copyright","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}},{"value":"This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (http:\/\/creativecommons.org\/licenses\/by\/4.0\/), which permits unrestricted re-use, distribution and reproduction, provided the original article is properly cited.","name":"license","label":"License","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}