{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T21:29:20Z","timestamp":1743110960829,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031436185"},{"type":"electronic","value":"9783031436192"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-43619-2_42","type":"book-chapter","created":{"date-parts":[[2023,9,23]],"date-time":"2023-09-23T15:02:40Z","timestamp":1695481360000},"page":"621-637","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimal Planning with Expressive Action Languages as Constraint Optimization"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5758-2556","authenticated-orcid":false,"given":"Enrico","family":"Giunchiglia","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9487-331X","authenticated-orcid":false,"given":"Armando","family":"Tacchella","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,9,24]]},"reference":[{"key":"42_CR1","unstructured":"Abdulaziz, M.: Cost optimal planning as satisfiability. CoRR abs\/2103.02355 (2021). arxiv.org\/abs\/2103.02355"},{"key":"42_CR2","doi-asserted-by":"publisher","unstructured":"Babb, J., Lee, J.: Action language $$\\cal{BC} $$+. J. Log. Comput. 30(4), 899\u2013922 (2020). https:\/\/doi.org\/10.1093\/logcom\/exv062","DOI":"10.1093\/logcom\/exv062"},{"key":"42_CR3","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/978-3-319-11558-0_37","volume-title":"Logics in Artificial Intelligence","author":"M Bartholomew","year":"2014","unstructured":"Bartholomew, M., Lee, J.: System aspmt2smt: computing ASPMT theories by SMT solvers. In: Ferm\u00e9, E., Leite, J. (eds.) JELIA 2014. LNCS (LNAI), vol. 8761, pp. 529\u2013542. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11558-0_37"},{"key":"42_CR4","unstructured":"Davies, T.O., Pearce, A.R., Stuckey, P.J., Lipovetzky, N.: Sequencing operator counts. In: Kambhampati, S. (ed.) Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, New York, NY, USA, 9\u201315 July 2016, pp. 4140\u20134144. IJCAI\/AAAI Press (2016)"},{"key":"42_CR5","doi-asserted-by":"publisher","unstructured":"Dovier, A., Formisano, A., Pontelli, E.: An investigation of multi-agent planning in CLP. Fundam. Inform. 105(1\u20132), 79\u2013103 (2010). https:\/\/doi.org\/10.3233\/FI-2010-359","DOI":"10.3233\/FI-2010-359"},{"key":"42_CR6","doi-asserted-by":"publisher","unstructured":"Eiter, T., Faber, W., Leone, N., Pfeifer, G., Polleres, A.: Answer set planning under action costs. J. Artif. Intell. Res. 19, 25\u201371 (2003). https:\/\/doi.org\/10.1613\/jair.1148","DOI":"10.1613\/jair.1148"},{"key":"42_CR7","unstructured":"Erdem, E., Gabaldon, A.: Cumulative effects of concurrent actions on numeric-valued fluents. In: Veloso, M.M., Kambhampati, S. (eds.) Proceedings, The Twentieth National Conference on Artificial Intelligence and the Seventeenth Innovative Applications of Artificial Intelligence Conference, 9\u201313 July 2005, Pittsburgh, Pennsylvania, USA, pp. 627\u2013632. AAAI Press\/The MIT Press (2005). www.aaai.org\/Library\/AAAI\/2005\/aaai05-098.php"},{"key":"42_CR8","doi-asserted-by":"publisher","unstructured":"Erdem, E., Lifschitz, V.: Tight logic programs. Theory Pract. Log. Program. 3(4\u20135), 499\u2013518 (2003). https:\/\/doi.org\/10.1017\/S1471068403001765","DOI":"10.1017\/S1471068403001765"},{"key":"42_CR9","doi-asserted-by":"crossref","unstructured":"Fox, M., Long, D.: PDDL2.1: an extension to PDDL for expressing temporal planning domains. J. Artif. Intell. Res. (JAIR) 20, 61\u2013124 (2003)","DOI":"10.1613\/jair.1129"},{"key":"42_CR10","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":"42_CR11","doi-asserted-by":"publisher","unstructured":"Giunchiglia, E., Lee, J., Lifschitz, V., McCain, N., Turner, H.: Nonmonotonic causal theories. Artif. Intell. 153(1\u20132), 49\u2013104 (2004). https:\/\/doi.org\/10.1016\/j.artint.2002.12.001","DOI":"10.1016\/j.artint.2002.12.001"},{"key":"42_CR12","unstructured":"Giunchiglia, E., Maratea, M.: A simple characterization of Stable Models and corresponding reduction to Difference Logic (2022). submitted"},{"key":"42_CR13","unstructured":"Haslum, P.: Incremental lower bounds for additive cost planning problems. In: McCluskey, L., Williams, B.C., Silva, J.R., Bonet, B. (eds.) Proceedings of the Twenty-Second International Conference on Automated Planning and Scheduling, ICAPS 2012, Atibaia, S\u00e3o Paulo, Brazil, 25\u201319 June 2012. AAAI (2012)"},{"key":"42_CR14","unstructured":"Haslum, P.: Optimal delete-relaxed (and semi-relaxed) planning with conditional effects. In: Rossi, F. (ed.) IJCAI 2013, Proceedings of the 23rd International Joint Conference on Artificial Intelligence, Beijing, China, 3\u20139 August 2013, pp. 2291\u20132297. IJCAI\/AAAI (2013)"},{"key":"42_CR15","doi-asserted-by":"publisher","unstructured":"Haslum, P., Lipovetzky, N., Magazzeni, D., Muise, C.: An Introduction to the Planning Domain Definition Language. Synthesis Lectures on Artificial Intelligence and Machine Learning. Morgan & Claypool Publishers, San Rafael (2019). https:\/\/doi.org\/10.2200\/S00900ED2V01Y201902AIM042","DOI":"10.2200\/S00900ED2V01Y201902AIM042"},{"key":"42_CR16","unstructured":"Helmert, M.: Decidability and undecidability results for planning with numerical state variables. In: Ghallab, M., Hertzberg, J., Traverso, P. (eds.) Proceedings of the Sixth International Conference on Artificial Intelligence Planning Systems, 23\u201327 April 2002, Toulouse, France, pp. 44\u201353. AAAI (2002). www.aaai.org\/Library\/AIPS\/2002\/aips02-005.php"},{"key":"42_CR17","unstructured":"Janhunen, T.: Representing normal programs with clauses. In: de M\u00e1ntaras, R.L., Saitta, L. (eds.) Proceedings of the 16th Eureopean Conference on Artificial Intelligence, ECAI\u20192004, including Prestigious Applicants of Intelligent Systems, PAIS 2004, Valencia, Spain, 22\u201327 August 2004, pp. 358\u2013362. IOS Press (2004)"},{"key":"42_CR18","unstructured":"Kautz, H.A., Selman, B.: Planning as satisfiability. In: ECAI, pp. 359\u2013363 (1992)"},{"key":"42_CR19","unstructured":"Lee, J., Lifschitz, V.: Additive fluents. In: Provetti, A., Son, T.C. (eds.) Answer Set Programming, Towards Efficient and Scalable Knowledge Representation and Reasoning, Proceedings of the 1st Intl. ASP\u201901 Workshop, Stanford, CA, USA, 26\u201328 March 2001. www.cs.nmsu.edu\/%7Etson\/ASP2001\/14.ps"},{"key":"42_CR20","doi-asserted-by":"publisher","unstructured":"Leofante, F., Giunchiglia, E., \u00c1brah\u00e1m, E., Tacchella, A.: Optimal planning modulo theories. In: Bessiere, C. (ed.) Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI 2020, pp. 4128\u20134134. ijcai.org (2020). https:\/\/doi.org\/10.24963\/ijcai.2020\/571","DOI":"10.24963\/ijcai.2020\/571"},{"key":"42_CR21","doi-asserted-by":"publisher","unstructured":"Lifschitz, V., Razborov, A.A.: Why are there so many loop formulas? ACM Trans. Comput. Log. 7(2), 261\u2013268 (2006). https:\/\/doi.org\/10.1145\/1131313.1131316","DOI":"10.1145\/1131313.1131316"},{"key":"42_CR22","unstructured":"Lin, F., Zhao, Y.: ASSAT: computing answer sets of a logic program by SAT solvers. In: AAAI, pp. 112\u2013118 (2002)"},{"issue":"1\u20134","key":"42_CR23","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s10472-009-9118-9","volume":"53","author":"I Niemel\u00e4","year":"2008","unstructured":"Niemel\u00e4, I.: Stable models and difference logic. Ann. Math. Artif. Intell. 53(1\u20134), 313\u2013329 (2008)","journal-title":"Ann. Math. Artif. Intell."},{"key":"42_CR24","doi-asserted-by":"crossref","unstructured":"Piacentini, C., Castro, M.P., Cir\u00e9, A.A., Beck, J.C.: Compiling optimal numeric planning to mixed integer linear programming. In: ICAPS, pp. 383\u2013387 (2018)","DOI":"10.1609\/icaps.v28i1.13919"},{"key":"42_CR25","doi-asserted-by":"publisher","unstructured":"Rintanen, J.: Planning as satisfiability: heuristics. Artif. Intell. 193, 45\u201386 (2012). https:\/\/doi.org\/10.1016\/j.artint.2012.08.001","DOI":"10.1016\/j.artint.2012.08.001"},{"issue":"12\u201313","key":"42_CR26","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":"42_CR27","doi-asserted-by":"crossref","unstructured":"Robinson, N., Gretton, C., Pham, D.N., Sattar, A.: Partial weighted MaxSAT for optimal planning. In: PRICAI, pp. 231\u2013243 (2010)","DOI":"10.1007\/978-3-642-15246-7_23"}],"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-031-43619-2_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,23]],"date-time":"2023-09-23T15:09:33Z","timestamp":1695481773000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43619-2_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031436185","9783031436192"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43619-2_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"24 September 2023","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":"Dresden","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"jelia2023","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"}},{"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":"111","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":"41","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":"11","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":"37% - 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,6","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)"}}]}}