{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T20:25:03Z","timestamp":1768163103948,"version":"3.49.0"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030944780","type":"print"},{"value":"9783030944797","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-94479-7_4","type":"book-chapter","created":{"date-parts":[[2022,1,7]],"date-time":"2022-01-07T09:02:57Z","timestamp":1641546177000},"page":"42-56","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Determining Action Reversibility in\u00a0STRIPS Using Answer Set Programming with\u00a0Quantifiers"],"prefix":"10.1007","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":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9713-7748","authenticated-orcid":false,"given":"Luk\u00e1\u0161","family":"Chrpa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,7]]},"reference":[{"issue":"5\u20136","key":"4_CR1","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1017\/S1471068419000140","volume":"19","author":"G Amendola","year":"2019","unstructured":"Amendola, G., Ricca, F., Truszczynski, M.: Beyond NP: quantifying over answer sets. Theory Pract. Log. Program. 19(5\u20136), 705\u2013721 (2019). https:\/\/doi.org\/10.1017\/S1471068419000140","journal-title":"Theory Pract. Log. Program."},{"issue":"12","key":"4_CR2","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1145\/2043174.2043195","volume":"54","author":"G Brewka","year":"2011","unstructured":"Brewka, G., Eiter, T., Truszczynski, M.: Answer set programming at a glance. Commun. ACM 54(12), 92\u2013103 (2011). https:\/\/doi.org\/10.1145\/2043174.2043195","journal-title":"Commun. ACM"},{"issue":"1\u20132","key":"4_CR3","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0004-3702(94)90081-7","volume":"69","author":"T Bylander","year":"1994","unstructured":"Bylander, T.: The computational complexity of propositional STRIPS planning. Artif. Intell. 69(1\u20132), 165\u2013204 (1994). https:\/\/doi.org\/10.1016\/0004-3702(94)90081-7","journal-title":"Artif. Intell."},{"issue":"2","key":"4_CR4","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1017\/S1471068419000450","volume":"20","author":"F Calimeri","year":"2020","unstructured":"Calimeri, F., et al.: Asp-core-2 input language format. Theory Pract. Log. Program. 20(2), 294\u2013309 (2020). https:\/\/doi.org\/10.1017\/S1471068419000450","journal-title":"Theory Pract. Log. Program."},{"key":"4_CR5","unstructured":"Camacho, A., Muise, C.J., McIlraith, S.A.: From FOND to robust probabilistic planning: computing compact policies that bypass avoidable deadends. In: Proceedings ICAPS, pp. 65\u201369 (2016). http:\/\/www.aaai.org\/ocs\/index.php\/ICAPS\/ICAPS16\/paper\/view\/13188"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Chrpa, L., Faber, W., Morak, M.: Universal and uniform action reversibility. In: Proceedings KR (2021)","DOI":"10.24963\/kr.2021\/63"},{"key":"4_CR7","doi-asserted-by":"publisher","unstructured":"Chrpa, L., Lipovetzky, N., Sardi\u00f1a, S.: Handling non-local dead-ends in agent planning programs. In: Proceedings IJCAI, pp. 971\u2013978 (2017). https:\/\/doi.org\/10.24963\/ijcai.2017\/135","DOI":"10.24963\/ijcai.2017\/135"},{"key":"4_CR8","unstructured":"Chrpa, L., McCluskey, T.L., Osborne, H.: Optimizing plans through analysis of action dependencies and independencies. In: Proceedings ICAPS (2012). http:\/\/www.aaai.org\/ocs\/index.php\/ICAPS\/ICAPS12\/paper\/view\/4712"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Cserna, B., Doyle, W.J., Ramsdell, J.S., Ruml, W.: Avoiding dead ends in real-time heuristic search. In: Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, (AAAI-18), pp. 1306\u20131313 (2018)","DOI":"10.1609\/aaai.v32i1.11533"},{"key":"4_CR10","unstructured":"Daum, J., Torralba, \u00c1., Hoffmann, J., Haslum, P., Weber, I.: Practical undoability checking via contingent planning. In: Proceedings ICAPS, pp. 106\u2013114 (2016). http:\/\/www.aaai.org\/ocs\/index.php\/ICAPS\/ICAPS16\/paper\/view\/13091"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/j.artint.2015.10.001","volume":"231","author":"G De Giacomo","year":"2016","unstructured":"De Giacomo, G., Gerevini, A.E., Patrizi, F., Saetti, A., Sardi\u00f1a, S.: Agent planning programs. Artif. Intell. 231, 64\u2013106 (2016). https:\/\/doi.org\/10.1016\/j.artint.2015.10.001","journal-title":"Artif. Intell."},{"issue":"3","key":"4_CR12","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1017\/S1471068418000583","volume":"19","author":"Y Dimopoulos","year":"2019","unstructured":"Dimopoulos, Y., Gebser, M., L\u00fchne, P., Romero, J., Schaub, T.: plasp 3: towards effective ASP planning. Theory Pract. Logic Program. 19(3), 477\u2013504 (2019). https:\/\/doi.org\/10.1017\/S1471068418000583","journal-title":"Theory Pract. Logic Program."},{"issue":"3","key":"4_CR13","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1016\/j.jal.2007.05.002","volume":"6","author":"T Eiter","year":"2008","unstructured":"Eiter, T., Erdem, E., Faber, W.: Undoing the effects of action sequences. J. Appl. Logic 6(3), 380\u2013415 (2008). https:\/\/doi.org\/10.1016\/j.jal.2007.05.002","journal-title":"J. Appl. Logic"},{"issue":"3\u20134","key":"4_CR14","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/BF01536399","volume":"15","author":"T Eiter","year":"1995","unstructured":"Eiter, T., Gottlob, G.: On the computational cost of disjunctive logic programming: propositional case. Ann. Math. Artif. Intell. 15(3\u20134), 289\u2013323 (1995)","journal-title":"Ann. Math. Artif. Intell."},{"issue":"5","key":"4_CR15","doi-asserted-by":"publisher","first-page":"646","DOI":"10.1017\/S1471068421000429","volume":"21","author":"W Faber","year":"2021","unstructured":"Faber, W., Morak, M., Chrpa, L.: Determining action reversibility in strips using answer set and epistemic logic programming. Theory Pract. Log. Program. 21(5), 646\u2013662 (2021)","journal-title":"Theory Pract. Log. Program."},{"issue":"3\/4","key":"4_CR16","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0004-3702(71)90010-5","volume":"2","author":"R Fikes","year":"1971","unstructured":"Fikes, R., Nilsson, N.J.: STRIPS: a new approach to the application of theorem proving to problem solving. Artif. Intell. 2(3\/4), 189\u2013208 (1971)","journal-title":"Artif. Intell."},{"issue":"3","key":"4_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2200\/S00457ED1V01Y201211AIM019","volume":"6","author":"M Gebser","year":"2012","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T.: Answer set solving in practice. Synth. Lect. Artif. Intell. Mach. Learn. 6(3), 1\u2013238 (2012). https:\/\/doi.org\/10.2200\/S00457ED1V01Y201211AIM019","journal-title":"Synth. Lect. Artif. Intell. Mach. Learn."},{"issue":"3\/4","key":"4_CR18","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF03037169","volume":"9","author":"M Gelfond","year":"1991","unstructured":"Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Gener. Comput. 9(3\/4), 365\u2013386 (1991). https:\/\/doi.org\/10.1007\/BF03037169","journal-title":"New Gener. Comput."},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Ghallab, M., Nau, D.S., Traverso, P.: Automated planning - theory and practice. Elsevier, Amsterdam (2004)","DOI":"10.1016\/B978-155860856-6\/50021-1"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Ghallab, M., Nau, D.S., Traverso, P.: Automated Planning and Acting. Cambridge University Press (2016). http:\/\/www.cambridge.org\/de\/academic\/subjects\/computer-science\/artificial-intelligence-and-natural-language-processing\/automated-planning-and-acting?format=HB","DOI":"10.1017\/CBO9781139583923"},{"key":"4_CR21","doi-asserted-by":"publisher","unstructured":"Hecking-Harbusch, J., Tentrup, L.: Solving QBF by abstraction. In: Orlandini, A., Zimmermann, M. (eds.) Proceedings Ninth International Symposium on Games, Automata, Logics, and Formal Verification, GandALF 2018, Saarbr\u00fccken, Germany, 26\u201328th September 2018, EPTCS, vol. 277, pp. 88\u2013102 (2018). https:\/\/doi.org\/10.4204\/EPTCS.277.7","DOI":"10.4204\/EPTCS.277.7"},{"key":"4_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-24658-7","volume-title":"Answer Set Programming","author":"V Lifschitz","year":"2019","unstructured":"Lifschitz, V.: Answer Set Programming. Springer, Heidelberg (2019)"},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"Lipovetzky, N., Muise, C.J., Geffner, H.: Traps, invariants, and dead-ends. In: Proceedings ICAPS, pp. 211\u2013215 (2016). http:\/\/www.aaai.org\/ocs\/index.php\/ICAPS\/ICAPS16\/paper\/view\/13190","DOI":"10.1016\/B978-0-08-100555-2.00021-7"},{"key":"4_CR24","doi-asserted-by":"publisher","unstructured":"Morak, M., Chrpa, L., Faber, W., Fi\u0161er, D.: On the reversibility of actions in planning. In: Proceedings KR, pp. 652\u2013661 (2020). https:\/\/doi.org\/10.24963\/kr.2020\/65","DOI":"10.24963\/kr.2020\/65"}],"container-title":["Lecture Notes in Computer Science","Practical Aspects of Declarative Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-94479-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,22]],"date-time":"2023-01-22T06:41:14Z","timestamp":1674369674000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-94479-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030944780","9783030944797"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-94479-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"7 January 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PADL","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Practical Aspects of Declarative Languages","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Philadelphia, PA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 January 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 January 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"padl2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/popl22.sigplan.org\/home\/PADL-2022","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"22","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}