{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:53:43Z","timestamp":1757627623621,"version":"3.44.0"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783032045867"},{"type":"electronic","value":"9783032045874"}],"license":[{"start":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T00:00:00Z","timestamp":1756425600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T00:00:00Z","timestamp":1756425600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-04587-4_20","type":"book-chapter","created":{"date-parts":[[2025,9,2]],"date-time":"2025-09-02T09:29:27Z","timestamp":1756805367000},"page":"327-342","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Encoding Action Reversibility In Planning Using Quantified ASP and\u00a0Bule"],"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":[]}],"member":"297","published-online":{"date-parts":[[2025,8,29]]},"reference":[{"issue":"5\u20136","key":"20_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":"20_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":"20_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."},{"key":"20_CR4","doi-asserted-by":"publisher","unstructured":"Cabalar, P., Fandinno, J., Garea, J., Romero, J., Schaub, T.: eclingo\u202f: a solver for epistemic logic programs. Theory Pract. Log. Program. 20(6), 834\u2013847 (2020). https:\/\/doi.org\/10.1017\/S1471068420000228","DOI":"10.1017\/S1471068420000228"},{"issue":"2","key":"20_CR5","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":"20_CR6","doi-asserted-by":"publisher","unstructured":"Chrpa, L., Faber, W., Morak, M.: Universal and uniform action reversibility. In: Proceedings of the KR, pp. 651\u2013654 (2021). https:\/\/doi.org\/10.24963\/kr.2021\/63","DOI":"10.24963\/kr.2021\/63"},{"key":"20_CR7","doi-asserted-by":"publisher","unstructured":"Chrpa, L., Lipovetzky, N., Sardi\u00f1a, S.: Handling non-local dead-ends in agent planning programs. In: Proceedings of the IJCAI, pp. 971\u2013978 (2017). https:\/\/doi.org\/10.24963\/ijcai.2017\/135","DOI":"10.24963\/ijcai.2017\/135"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Chrpa, L., McCluskey, T.L., Osborne, H.: Optimizing plans through analysis of action dependencies and independencies. In: Proceedings of the ICAPS (2012). http:\/\/www.aaai.org\/ocs\/index.php\/ICAPS\/ICAPS12\/paper\/view\/4712","DOI":"10.1609\/icaps.v22i1.13536"},{"key":"20_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":"20_CR10","doi-asserted-by":"crossref","unstructured":"Daum, J., Torralba, \u00c1., Hoffmann, J., Haslum, P., Weber, I.: Practical undoability checking via contingent planning. In: Proceedings of the ICAPS, pp. 106\u2013114 (2016)","DOI":"10.1609\/icaps.v26i1.13751"},{"key":"20_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":"20_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. TPLP 19(3), 477\u2013504 (2019). https:\/\/doi.org\/10.1017\/S1471068418000583","journal-title":"TPLP"},{"issue":"3","key":"20_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"},{"key":"20_CR14","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1007\/BF01536399","DOI":"10.1007\/BF01536399"},{"issue":"5","key":"20_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. TPLP 21(5), 646\u2013662 (2021). https:\/\/doi.org\/10.1017\/S1471068421000429","journal-title":"TPLP"},{"key":"20_CR16","doi-asserted-by":"publisher","unstructured":"Faber, W., Morak, M., Chrpa, L.: Determining action reversibility in STRIPS using answer set programming with quantifiers. In: Proceedings of the PADL, pp. 42\u201356 (2022). https:\/\/doi.org\/10.1007\/978-3-030-94479-7_4","DOI":"10.1007\/978-3-030-94479-7_4"},{"key":"20_CR17","doi-asserted-by":"publisher","unstructured":"Fandinno, J., Laferri\u00e8re, F., Romero, J., Schaub, T., Son, T.C.: Planning with incomplete information in quantified answer set programming. Theory Pract. Log. Program. 21(5), 663\u2013679 (2021). https:\/\/doi.org\/10.1017\/S1471068421000259","DOI":"10.1017\/S1471068421000259"},{"key":"20_CR18","doi-asserted-by":"publisher","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T.: Answer Set Solving in Practice. Synthesis Lectures on Artificial Intelligence and Machine Learning, Morgan & Claypool Publishers (2012). https:\/\/doi.org\/10.2200\/S00457ED1V01Y201211AIM019","DOI":"10.2200\/S00457ED1V01Y201211AIM019"},{"issue":"1","key":"20_CR19","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1017\/S1471068418000054","volume":"19","author":"M Gebser","year":"2019","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T.: Multi-shot ASP solving with clingo. Theory Pract. Log. Program. 19(1), 27\u201382 (2019)","journal-title":"Theory Pract. Log. Program."},{"issue":"3\/4","key":"20_CR20","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":"20_CR21","doi-asserted-by":"crossref","unstructured":"Ghallab, M., Nau, D.S., Traverso, P.: Automated planning - theory and practice. Elsevier (2004)","DOI":"10.1016\/B978-155860856-6\/50021-1"},{"key":"20_CR22","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":"20_CR23","doi-asserted-by":"publisher","unstructured":"Jung, J.C., Mayer-Eichberger, V., Saffidine, A.: QBF programming with the modeling language bule. In: Proceedings of the SAT. LIPIcs, vol.\u00a0236, pp. 31:1\u201331:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022). https:\/\/doi.org\/10.4230\/LIPICS.SAT.2022.31","DOI":"10.4230\/LIPICS.SAT.2022.31"},{"key":"20_CR24","doi-asserted-by":"publisher","unstructured":"Lifschitz, V.: Answer Set Programming. Springer (2019). https:\/\/doi.org\/10.1007\/978-3-030-24658-7","DOI":"10.1007\/978-3-030-24658-7"},{"key":"20_CR25","doi-asserted-by":"crossref","unstructured":"Lipovetzky, N., Muise, C.J., Geffner, H.: Traps, invariants, and dead-ends. In: Proceedings of the ICAPS, pp. 211\u2013215 (2016). http:\/\/www.aaai.org\/ocs\/index.php\/ICAPS\/ICAPS16\/paper\/view\/13190","DOI":"10.1609\/icaps.v26i1.13774"},{"key":"20_CR26","doi-asserted-by":"publisher","unstructured":"Lonsing, F., Egly, U.: DepQBF 6.0: a search-based QBF solver beyond traditional QCDCL. In: Proceedings of the CADE. LNCS, vol. 10395, pp. 371\u2013384. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63046-5_23","DOI":"10.1007\/978-3-319-63046-5_23"},{"key":"20_CR27","doi-asserted-by":"publisher","unstructured":"Med, J., Chrpa, L., Morak, M., Faber, W.: Weak and strong reversibility of non-deterministic actions: universality and uniformity. In: Proceedings of the ICAPS, pp. 369\u2013377. AAAI Press (2024). https:\/\/doi.org\/10.1609\/ICAPS.V34I1.31496","DOI":"10.1609\/ICAPS.V34I1.31496"},{"key":"20_CR28","doi-asserted-by":"publisher","unstructured":"Morak, M., Chrpa, L., Faber, W., Fi\u0161er, D.: On the reversibility of actions in planning. In: Proceedings of the KR, pp. 652\u2013661 (2020). https:\/\/doi.org\/10.24963\/kr.2020\/65","DOI":"10.24963\/kr.2020\/65"},{"key":"20_CR29","doi-asserted-by":"publisher","unstructured":"Schwartz, T., Boockmann, J.H., Martin, L.: Towards the evaluation of action reversibility in STRIPS using domain generators. In: Proceedings of the FoIKS. LNCS, vol. 13388, pp. 226\u2013236. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-11321-5_13","DOI":"10.1007\/978-3-031-11321-5_13"}],"container-title":["Lecture Notes in Computer Science","Logics in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-04587-4_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T04:15:59Z","timestamp":1757477759000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-04587-4_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,29]]},"ISBN":["9783032045867","9783032045874"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-04587-4_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,8,29]]},"assertion":[{"value":"29 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"JELIA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Logics in Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kutaisi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Georgia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"jelia2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.jelia.eu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}