{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T14:03:20Z","timestamp":1743084200599,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031084201"},{"type":"electronic","value":"9783031084218"}],"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-031-08421-8_2","type":"book-chapter","created":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T21:02:38Z","timestamp":1658178158000},"page":"18-31","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Sound (But Incomplete) Polynomial Translation from\u00a0Discretised PDDL+ to\u00a0Numeric Planning"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7332-0636","authenticated-orcid":false,"given":"Francesco","family":"Percassi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2274-875X","authenticated-orcid":false,"given":"Enrico","family":"Scala","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8429-3570","authenticated-orcid":false,"given":"Mauro","family":"Vallati","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,7,19]]},"reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-030-35166-3_10","volume-title":"AI*IA 2019 \u2013 Advances in Artificial Intelligence","author":"R Bertolucci","year":"2019","unstructured":"Bertolucci, R., Capitanelli, A., Maratea, M., Mastrogiovanni, F., Vallati, M.: Automated planning encodings for the manipulation of articulated objects in 3D with gravity. In: Alviano, M., Greco, G., Scarcello, F. (eds.) AI*IA 2019. LNCS (LNAI), vol. 11946, pp. 135\u2013150. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-35166-3_10"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Bonassi, L., Gerevini, A.E., Percassi, F., Scala, E.: On planning with qualitative state-trajectory constraints in PDDL3 by compiling them away. In: Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling, ICAPS 2021, pp. 46\u201350 (2021)","DOI":"10.24963\/ijcai.2022\/639"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Cooper, M.C., Maris, F., R\u00e9gnier, P.: Compilation of a high-level temporal planning language into PDDL 2.1. In: Twenty-Second IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2010, pp. 181\u2013188 (2010)","DOI":"10.1109\/ICTAI.2010.99"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Fox, M., Long, D.: PDDL2.1: an extension to PDDL for expressing temporal planning domains. J. Artif. Intell. Res. 20, 61\u2013124 (2003)","DOI":"10.1613\/jair.1129"},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1613\/jair.2044","volume":"27","author":"M Fox","year":"2006","unstructured":"Fox, M., Long, D.: Modelling mixed discrete-continuous domains for planning. J. Artif. Intell. Res. 27, 235\u2013297 (2006)","journal-title":"J. Artif. Intell. Res."},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Grastien, A., Scala, E.: Intelligent belief state sampling for conformant planning. In: Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, pp. 4317\u20134323 (2017)","DOI":"10.24963\/ijcai.2017\/603"},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1613\/jair.1144","volume":"20","author":"J Hoffmann","year":"2003","unstructured":"Hoffmann, J.: The metric-FF planning system: translating \u201cignoring delete lists\u2019\u2019 to numeric state variables. J. Artif. Intell. Res. 20, 291\u2013341 (2003)","journal-title":"J. Artif. Intell. Res."},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1613\/jair.2857","volume":"36","author":"E Keyder","year":"2009","unstructured":"Keyder, E., Geffner, H.: Soft goals can be compiled away. J. Artif. Intell. Res. 36, 547\u2013556 (2009)","journal-title":"J. Artif. Intell. Res."},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1613\/jair.2708","volume":"35","author":"H Palacios","year":"2009","unstructured":"Palacios, H., Geffner, H.: Compiling uncertainty away in conformant planning problems with bounded width. J. Artif. Intell. Res. 35, 623\u2013675 (2009)","journal-title":"J. Artif. Intell. Res."},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Percassi, F., Gerevini, A.E.: On compiling away PDDL3 soft trajectory constraints without using automata. In: Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, ICAPS 2019, pp. 320\u2013328 (2019)","DOI":"10.1609\/icaps.v29i1.3494"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Percassi, F., Scala, E., Vallati, M.: Translations from discretised PDDL+ to numeric planning. In: Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling, ICAPS 2021, pp. 252\u2013261 (2021)","DOI":"10.1609\/icaps.v31i1.15969"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Scala, E., Grastien, A.: Non-deterministic conformant planning using a counterexample-guided incremental compilation to classical planning. In: Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling, ICAPS 2021, pp. 299\u2013307 (2021)","DOI":"10.1609\/icaps.v31i1.15974"},{"key":"2_CR13","unstructured":"Scala, E., Haslum, P., Thi\u00e9baux, S., Ram\u00edrez, M.: Interval-based relaxation for general numeric planning. In: Proceedings of the Twenty-Second European Conference on Artificial Intelligence, ECAI 2016, vol. 285, pp. 655\u2013663 (2016)"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Taig, R., Brafman, R.I.: Compiling conformant probabilistic planning problems into classical planning. In: Proceedings of the Twenty-Third International Conference on Automated Planning and Scheduling, ICAPS 2013, pp. 197\u2013205 (2013)","DOI":"10.1609\/icaps.v23i1.13540"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Vallati, M., Magazzeni, D., Schutter, B.D., Chrpa, L., McCluskey, T.L.: Efficient macroscopic urban traffic models for reducing congestion: a PDDL+ planning approach. In: Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, AAAI 2016, pp. 3188\u20133194 (2016)","DOI":"10.1609\/aaai.v30i1.10399"}],"container-title":["Lecture Notes in Computer Science","AIxIA 2021 \u2013 Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-08421-8_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,11]],"date-time":"2023-02-11T22:29:48Z","timestamp":1676154588000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-08421-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031084201","9783031084218"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-08421-8_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"19 July 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AIxIA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference of the Italian Association for Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aiia2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/aixia2021.disco.unimib.it\/","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":"58","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":"36","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":"0","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":"62% - 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":"2","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":"2","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)"}}]}}