{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T15:17:16Z","timestamp":1781018236210,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T00:00:00Z","timestamp":1774224000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"Austrian Science Fund (FWF)","award":["10.55776\/PIN8782623"],"award-info":[{"award-number":["10.55776\/PIN8782623"]}]},{"name":"Austrian Science Fund (FWF)","award":["10.55776\/COE12"],"award-info":[{"award-number":["10.55776\/COE12"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,3,23]]},"DOI":"10.1145\/3748522.3779755","type":"proceedings-article","created":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T14:17:49Z","timestamp":1781014669000},"page":"962-969","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Logic-based Languages For Solving Reversibility in Planning"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0330-5868","authenticated-orcid":false,"given":"Wolfgang","family":"Faber","sequence":"first","affiliation":[{"name":"University of Klagenfurt, Klagenfurt, Austria"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2077-7672","authenticated-orcid":false,"given":"Michael","family":"Morak","sequence":"additional","affiliation":[{"name":"University of Klagenfurt, Klagenfurt, Austria"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,6,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068419000140"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2043174.2043195"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(94)90081-7"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068420000228"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068419000450"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.24963\/kr.2021\/63"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/135"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v22i1.13536"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11533"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v26i1.13751"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2015.10.001"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068418000583"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jal.2007.05.002"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01536399"},{"key":"e_1_3_2_1_15_1","first-page":"646","article-title":"Determining action reversibility in STRIPS using answer set and epistemic logic programming","volume":"21","author":"Faber Wolfgang","year":"2021","unstructured":"Wolfgang Faber, Michael Morak, and Luk\u00e1s Chrpa. 2021. Determining action reversibility in STRIPS using answer set and epistemic logic programming. TPLP, 21, 5, 646\u2013662.","journal-title":"TPLP"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-94479-7_4"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068421000259"},{"key":"e_1_3_2_1_18_1","volume-title":"Answer Set Solving in Practice. Synthesis Lectures on Artificial Intelligence and Machine Learning","author":"Gebser Martin","unstructured":"Martin Gebser, Roland Kaminski, Benjamin Kaufmann, and Torsten Schaub. 2012. Answer Set Solving in Practice. Synthesis Lectures on Artificial Intelligence and Machine Learning. Morgan & Claypool Publishers."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068418000054"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01530762"},{"key":"e_1_3_2_1_21_1","volume-title":"Press \/","author":"Gelfond Michael","year":"1991","unstructured":"Michael Gelfond. 1991. Strong introspection. In Proc. AAAI. Thomas L. Dean and Kathleen R. McKeown, (Eds.) AAAI Press \/ The MIT Press, 386\u2013391. http:\/\/www.aaai.org\/Library\/AAAI\/1991\/aaai91-060.php."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Michael Gelfond and Vladimir Lifschitz. 1991. Classical negation in logic programs and disjunctive databases. New Gener. Comput. 9 3\/4 365\u2013386.","DOI":"10.1007\/BF03037169"},{"key":"e_1_3_2_1_23_1","volume-title":"Automated planning - theory and practice","author":"Ghallab Malik","unstructured":"Malik Ghallab, Dana S. Nau, and Paolo Traverso. 2004. Automated planning - theory and practice. Elsevier. isbn: 978-1-55860-856-6."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139583923"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.4204\/EPTCS.277.7"},{"key":"e_1_3_2_1_26_1","first-page":"1","article-title":"QBF programming with the modeling language bule. In Proc. SAT (LIPIcs). Vol. 236","volume":"31","author":"Jung Jean Christoph","year":"2022","unstructured":"Jean Christoph Jung, Valentin Mayer-Eichberger, and Abdallah Saffidine. 2022. QBF programming with the modeling language bule. In Proc. SAT (LIPIcs). Vol. 236. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 31:1\u201331:14.","journal-title":"Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik"},{"key":"e_1_3_2_1_27_1","volume-title":"Also in Proc. of ASPOCP 2018","author":"Anthony","year":"1809","unstructured":"Anthony P. Leclerc and Patrick Thor Kahl. 2018. A survey of advances in epistemic logic program solvers. CoRR, abs\/1809.07141. Also in Proc. of ASPOCP 2018. http:\/\/arxiv.org\/abs\/1809.07141 arXiv: 1809.07141."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-24658-7"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v26i1.13774"},{"key":"e_1_3_2_1_30_1","volume-title":"Proc. CADE (LNCS).","author":"Lonsing Florian","unstructured":"Florian Lonsing and Uwe Egly. 2017. Depqbf 6.0: A search-based QBF solver beyond traditional QCDCL. In Proc. CADE (LNCS). Vol. 10395. Springer, 371\u2013384."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v34i1.31496"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.24963\/kr.2020\/65"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-11321-5_13"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2016.04.004"}],"event":{"name":"SAC '26: 41st ACM\/SIGAPP Symposium on Applied Computing","location":"Grand Hotel Palace Thessaloniki Greece","acronym":"SAC '26","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"]},"container-title":["Proceedings of the 41st ACM\/SIGAPP Symposium on Applied Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3748522.3779755","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T14:20:43Z","timestamp":1781014843000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3748522.3779755"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,23]]},"references-count":34,"alternative-id":["10.1145\/3748522.3779755","10.1145\/3748522"],"URL":"https:\/\/doi.org\/10.1145\/3748522.3779755","relation":{},"subject":[],"published":{"date-parts":[[2026,3,23]]},"assertion":[{"value":"2026-06-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}