{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:51:26Z","timestamp":1757627486074,"version":"3.44.0"},"publisher-location":"Cham","reference-count":46,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783032045898"},{"type":"electronic","value":"9783032045904"}],"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-04590-4_6","type":"book-chapter","created":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T13:50:38Z","timestamp":1756734638000},"page":"77-93","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["AxSAT \u2013 Bringing Axioms to\u00a0SAT Planning"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1445-9934","authenticated-orcid":false,"given":"Gregor","family":"Behnke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5493-7363","authenticated-orcid":false,"given":"David","family":"Speck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7434-2669","authenticated-orcid":false,"given":"Daniel","family":"Gnad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,8,29]]},"reference":[{"key":"6_CR1","unstructured":"Proceedings of the ICAPS 2024 (2024)"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Balyo, T.: Relaxing the relaxed exist-step parallel planning semantics. In: 25th International Conference on Tools with Artificial Intelligence (ICTAI 2013), pp. 865\u2013871. IEEE Computer Society (2013)","DOI":"10.1109\/ICTAI.2013.131"},{"key":"6_CR3","doi-asserted-by":"publisher","unstructured":"Behnke, G.: Block compression and invariant pruning for SAT-based totally-ordered HTN planning. In: ICAPS 2021, pp. 25\u201335. AAAI Press (2021). https:\/\/doi.org\/10.1609\/icaps.v31i1.15943","DOI":"10.1609\/icaps.v31i1.15943"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Behnke, G., H\u00f6ller, D., Biundo, S.: totSAT \u2013 totally-ordered hierarchical planning through SAT. In: AAAI 2018, pp. 6110\u20136118. AAAI Press (2018)","DOI":"10.1609\/aaai.v32i1.12083"},{"key":"6_CR5","doi-asserted-by":"publisher","unstructured":"Behnke, G., H\u00f6ller, D., Biundo, S.: Bringing order to chaos \u2013 a compact representation of partial order in SAT-based HTN planning. In: AAAI 2019, pp. 7520\u20137529. AAAI Press (2019). https:\/\/doi.org\/10.1609\/aaai.v33i01.33017520","DOI":"10.1609\/aaai.v33i01.33017520"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Behnke, G., Speck, D., Gnad, D.: AxSAT \u2013 bringing axioms to sat planning (2025). https:\/\/doi.org\/10.5281\/zenodo.15848556","DOI":"10.1007\/978-3-032-04590-4_6"},{"key":"6_CR7","unstructured":"Bofill, M., Borralleras, C., Espasa, J., Mart\u00edn, G., Patow, G., Villaret, M.: A good snowman is hard to plan. arXiv:2310.01471 [cs.AI] (2023)"},{"issue":"5","key":"6_CR8","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1017\/S0269888916000229","volume":"31","author":"M Bofill","year":"2016","unstructured":"Bofill, M., Espasa, J., Villaret, M.: The RANTANPLAN planner: system description. Knowl. Eng. Rev. 31(5), 452\u2013464 (2016)","journal-title":"Knowl. Eng. Rev."},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Bryce, D., Gao, S., Musliner, D.J., Goldman, R.P.: SMT-based nonlinear PDDL+ planning. In: Proceedings of the AAAI 2015, pp. 3247\u20133253 (2015)","DOI":"10.1609\/aaai.v29i1.9646"},{"issue":"3","key":"6_CR10","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. Log. Program. 19(3), 477\u2013504 (2019)","journal-title":"Theory Pract. Log. Program."},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Dimopoulos, Y., Nebel, B., Koehler, J.: Encoding planning problems in nonmonotonic logic programs. In: Proceedings of the ECAI 1997, pp. 169\u2013181 (1997)","DOI":"10.1007\/3-540-63912-8_84"},{"key":"6_CR12","unstructured":"Frisch, A.M., Giannaros, P.A.: SAT encodings of the at-most-k constraint: some old, some new, some fast, some slow (2010). Manuscript"},{"key":"6_CR13","unstructured":"Gebser, M., Janhunen, T., Rintanen, J.: ASP encodings of acyclicity properties. In: Proceedings of the KR 2014, pp. 634\u2013637 (2014)"},{"issue":"4","key":"6_CR14","doi-asserted-by":"publisher","first-page":"923","DOI":"10.1093\/logcom\/exv063","volume":"30","author":"M Gebser","year":"2020","unstructured":"Gebser, M., Janhunen, T., Rintanen, J.: Declarative encodings of acyclicity properties. J. Log. Comput. 30(4), 923\u2013952 (2020)","journal-title":"J. Log. Comput."},{"key":"6_CR15","first-page":"24","volume":"257","author":"D Gnad","year":"2018","unstructured":"Gnad, D., Hoffmann, J.: Star-topology decoupled state space search. AIJ 257, 24\u201360 (2018)","journal-title":"AIJ"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Grundke, C., R\u00f6ger, G., Helmert, M.: Formal representations of classical planning domains. In: Proceedings of the ICAPS 2024 [1], pp. 239\u2013248 (2024)","DOI":"10.1609\/icaps.v34i1.31481"},{"key":"6_CR17","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1613\/jair.1705","volume":"26","author":"M Helmert","year":"2006","unstructured":"Helmert, M.: The Fast Downward planning system. JAIR 26, 191\u2013246 (2006)","journal-title":"JAIR"},{"key":"6_CR18","first-page":"503","volume":"173","author":"M Helmert","year":"2009","unstructured":"Helmert, M.: Concise finite-domain representations for PDDL planning tasks. AIJ 173, 503\u2013535 (2009)","journal-title":"AIJ"},{"key":"6_CR19","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1613\/jair.855","volume":"14","author":"J Hoffmann","year":"2001","unstructured":"Hoffmann, J., Nebel, B.: The FF planning system: fast plan generation through heuristic search. JAIR 14, 253\u2013302 (2001)","journal-title":"JAIR"},{"key":"6_CR20","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1613\/jair.3442","volume":"43","author":"R Huang","year":"2012","unstructured":"Huang, R., Chen, Y., Zhang, W.: SAS$$^+$$ planning as satisfiability. JAIR 43, 293\u2013328 (2012)","journal-title":"JAIR"},{"key":"6_CR21","doi-asserted-by":"publisher","unstructured":"H\u00f6ller, D., Behnke, G.: Encoding lifted classical planning in propositional logic. In: ICAPS 2022, pp. 137\u2013144. AAAI Press (2022). https:\/\/doi.org\/10.1609\/icaps.v32i1.19794","DOI":"10.1609\/icaps.v32i1.19794"},{"key":"6_CR22","unstructured":"Ivankovic, F., Haslum, P.: Optimal planning with axioms. In: Proceedings of the IJCAI 2015, pp. 1580\u20131586 (2015)"},{"issue":"1","key":"6_CR23","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/BF02523689","volume":"18","author":"DR Karger","year":"1997","unstructured":"Karger, D.R., Motwani, R., Ramkumar, G.D.S.: On approximating the longest path in a graph. Algorithmica 18(1), 82\u201398 (1997)","journal-title":"Algorithmica"},{"key":"6_CR24","unstructured":"Kautz, H., Selman, B.: Planning as satisfiability. In: Proceedings of the ECAI 1992, pp. 359\u2013363 (1992)"},{"key":"6_CR25","unstructured":"Kautz, H., Selman, B.: Pushing the envelope: planning, propositional logic, and stochastic search. In: Proceedings of the AAAI 1996, pp. 1194\u20131201 (1996)"},{"issue":"2","key":"6_CR26","first-page":"35","volume":"21","author":"D McDermott","year":"2000","unstructured":"McDermott, D.: The 1998 AI planning systems competition. AI Mag. 21(2), 35\u201355 (2000)","journal-title":"AI Mag."},{"key":"6_CR27","doi-asserted-by":"crossref","unstructured":"Miura, S., Fukunaga, A.: Automatic extraction of axioms for planning. In: Proceedings of the ICAPS 2017, pp. 218\u2013227 (2017)","DOI":"10.1609\/icaps.v27i1.13815"},{"key":"6_CR28","doi-asserted-by":"crossref","unstructured":"Quenard, G., Pellier, D., Fiorino, H.: SibylSat: using sat as an oracle to perform a greedy search on TOHTN planning. In: ECAI 2024, pp. 4157\u20134164. IOS Press (2024)","DOI":"10.3233\/FAIA240987"},{"key":"6_CR29","doi-asserted-by":"crossref","unstructured":"Rankooh, M.F., Rintanen, J.: Propositional encodings of acyclicity and reachability by using vertex elimination. In: Proceedings of the AAAI 2022, pp. 5861\u20135868 (2022)","DOI":"10.1609\/aaai.v36i5.20530"},{"key":"6_CR30","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1613\/jair.2972","volume":"39","author":"S Richter","year":"2010","unstructured":"Richter, S., Westphal, M.: The LAMA planner: guiding cost-based anytime planning with landmarks. JAIR 39, 127\u2013177 (2010)","journal-title":"JAIR"},{"key":"6_CR31","unstructured":"Rintanen, J.: Madagascar: scalable planning with SAT. In: IPC-8 Planner Abstracts, pp. 66\u201370 (2014)"},{"key":"6_CR32","doi-asserted-by":"crossref","unstructured":"Rintanen, J.: Temporal planning with clock-based SMT encodings. In: Proceedings of the IJCAI 2017, pp. 743\u2013749 (2017)","DOI":"10.24963\/ijcai.2017\/103"},{"issue":"12\u201313","key":"6_CR33","doi-asserted-by":"publisher","first-page":"1031","DOI":"10.1016\/j.artint.2006.08.002","volume":"170","author":"J Rintanen","year":"2006","unstructured":"Rintanen, J., Heljanko, K., Niemel\u00e4, I.: Planning as satisfiability: parallel plans and algorithms for plan search. Artif. Intell. 170(12\u201313), 1031\u20131080 (2006)","journal-title":"Artif. Intell."},{"key":"6_CR34","unstructured":"R\u00f6ger, G., Grundke, C.: Negated occurrences of predicates in PDDL axiom bodies. In: Proceedings of the KI-2024 Workshop on Planning, Scheduling, Design and Configuration (PuK 2024) (2024)"},{"key":"6_CR35","doi-asserted-by":"crossref","unstructured":"Scala, E., Ramirez, M., Haslum, P., Thi\u00e9baux, S.: Numeric planning with disjunctive global constraints via SMT. In: ICAPS 2016, pp. 276\u2013284 (2016)","DOI":"10.1609\/icaps.v26i1.13766"},{"key":"6_CR36","doi-asserted-by":"publisher","first-page":"1117","DOI":"10.1613\/jair.1.12520","volume":"70","author":"D Schreiber","year":"2021","unstructured":"Schreiber, D.: Lilotane: a lifted SAT-based approach to hierarchical planning. JAIR 70, 1117\u20131181 (2021)","journal-title":"JAIR"},{"key":"6_CR37","unstructured":"Seipp, J., Pommerening, F., Sievers, S., Helmert, M.: Downward lab (2017). https:\/\/doi.org\/10.5281\/zenodo.790461"},{"key":"6_CR38","doi-asserted-by":"crossref","unstructured":"Shaik, I., van de Pol, J.: Classical planning as QBF without grounding. In: Proceedings of the ICAPS 2022, pp. 329\u2013337 (2022)","DOI":"10.1609\/icaps.v32i1.19817"},{"key":"6_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"827","DOI":"10.1007\/11564751_73","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"C Sinz","year":"2005","unstructured":"Sinz, C.: Towards an optimal CNF encoding of Boolean cardinality constraints. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 827\u2013831. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11564751_73"},{"key":"6_CR40","doi-asserted-by":"crossref","unstructured":"Speck, D., Gei\u00dfer, F., Mattm\u00fcller, R., Torralba, \u00c1.: Symbolic planning with axioms. In: Proceedings of the ICAPS 2019, pp. 464\u2013472 (2019)","DOI":"10.1609\/icaps.v29i1.3511"},{"key":"6_CR41","doi-asserted-by":"crossref","unstructured":"Speck, D., Gnad, D.: Decoupled search for the masses: a novel task transformation for classical planning. In: Proceedings of the ICAPS 2024 [1], pp. 546\u2013554 (2024)","DOI":"10.1609\/icaps.v34i1.31516"},{"key":"6_CR42","doi-asserted-by":"crossref","unstructured":"Speck, D., Mattm\u00fcller, R., Nebel, B.: Symbolic top-k planning. In: Proceedings of the AAAI 2020, pp. 9967\u20139974 (2020)","DOI":"10.1609\/aaai.v34i06.6552"},{"key":"6_CR43","doi-asserted-by":"publisher","first-page":"1349","DOI":"10.1613\/jair.1.16869","volume":"82","author":"D Speck","year":"2025","unstructured":"Speck, D., Seipp, J., Torralba, \u00c1.: Symbolic search for cost-optimal planning with expressive model extensions. JAIR 82, 1349\u20131405 (2025)","journal-title":"JAIR"},{"issue":"1\u20132","key":"6_CR44","first-page":"38","volume":"168","author":"S Thi\u00e9baux","year":"2005","unstructured":"Thi\u00e9baux, S., Hoffmann, J., Nebel, B.: In defense of PDDL axioms. AIJ 168(1\u20132), 38\u201369 (2005)","journal-title":"AIJ"},{"key":"6_CR45","doi-asserted-by":"crossref","unstructured":"Tseitin, G.: On the complexity of derivation in the propositional calculus. In: Studies in Constructive Mathematics and Mathematical Logic, Part II, pp. 115\u2013125. Consultants Bureau, New York (1968). English Translation","DOI":"10.1007\/978-1-4899-5327-8_25"},{"key":"6_CR46","doi-asserted-by":"crossref","unstructured":"Wehrle, M., Rintanen, J.: Planning as satisfiability with relaxed $$\\exists $$-step plans. In: Proceedings of the AJCAI 2007, pp. 244\u2013253 (2007)","DOI":"10.1007\/978-3-540-76928-6_26"}],"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-04590-4_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T03:37:55Z","timestamp":1757475475000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-04590-4_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,29]]},"ISBN":["9783032045898","9783032045904"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-04590-4_6","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"}}]}}