{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T13:25:09Z","timestamp":1762953909436,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031271809"},{"type":"electronic","value":"9783031271816"}],"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-27181-6_12","type":"book-chapter","created":{"date-parts":[[2023,3,10]],"date-time":"2023-03-10T04:34:21Z","timestamp":1678422861000},"page":"171-183","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Verification of\u00a0Numeric Planning Problems Through Domain Dynamic Consistency"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2274-875X","authenticated-orcid":false,"given":"Enrico","family":"Scala","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8181-8127","authenticated-orcid":false,"given":"Thomas L.","family":"McCluskey","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":[[2023,3,11]]},"reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-319-24489-1_2","volume-title":"KI 2015: Advances in Artificial Intelligence","author":"J Aldinger","year":"2015","unstructured":"Aldinger, J., Mattm\u00fcller, R., G\u00f6belbecker, M.: Complexity of interval relaxed numeric planning. In: H\u00f6lldobler, S., Kr\u00f6tzsch, M., Pe\u00f1aloza, R., Rudolph, S. (eds.) KI 2015. LNCS (LNAI), vol. 9324, pp. 19\u201331. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-24489-1_2"},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-319-67190-1_2","volume-title":"KI 2017: Advances in Artificial Intelligence","author":"J Aldinger","year":"2017","unstructured":"Aldinger, J., Nebel, B.: Interval based relaxation heuristics for numeric planning with action costs. In: Kern-Isberner, G., F\u00fcrnkranz, J., Thimm, M. (eds.) KI 2017. LNCS (LNAI), vol. 10505, pp. 15\u201328. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-67190-1_2"},{"issue":"1","key":"12_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10009-013-0294-x","volume":"16","author":"S Bensalem","year":"2014","unstructured":"Bensalem, S., Havelund, K., Orlandini, A.: Verification and validation meet planning and scheduling. Int. J. Softw. Tools Technol. Transf. 16(1), 1\u201312 (2014)","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Bhatnagar, S., Mund, S., Scala, E., McCabe, K., McCluskey, L., Vallati, M.: On the challenges of on-the-fly knowledge acquisition for automated planning applications. In: 14th International Conference on Agents and Artificial Intelligence (2022)","DOI":"10.5220\/0010857100003116"},{"issue":"1\u20132","key":"12_CR5","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/S0004-3702(01)00108-4","volume":"129","author":"B Bonet","year":"2001","unstructured":"Bonet, B., Geffner, H.: Planning as heuristic search. Artif. Intell. 129(1\u20132), 5\u201333 (2001)","journal-title":"Artif. Intell."},{"key":"12_CR6","unstructured":"De Giacomo, G., Vardi, M.: Synthesis for LTL and LDL on finite traces. In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), pp. 1558\u20131564. AAAI Press (2015)"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-540-85845-4_24","volume-title":"KI 2008: Advances in Artificial Intelligence","author":"S Edelkamp","year":"2008","unstructured":"Edelkamp, S., Kissmann, P.: Partial symbolic pattern databases for optimal sequential planning. In: Dengel, A.R., Berns, K., Breuel, T.M., Bomarius, F., Roth-Berghofer, T.R. (eds.) KI 2008. LNCS (LNAI), vol. 5243, pp. 193\u2013200. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85845-4_24"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Fourati, F., Bhiri, M.T., Robbana, R.: Verification and validation of PDDL descriptions using Event-B formal method. In: Proceedings of the 5th International Conference on Multimedia Computing and Systems (ICMCS), pp. 770\u2013776 (2016)","DOI":"10.1109\/ICMCS.2016.7905631"},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1613\/jair.1129","volume":"20","author":"M Fox","year":"2003","unstructured":"Fox, M., Long, D.: PDDL2.1: an extension to PDDL for expressing temporal planning domains. J. Artif. Intell. Res. 20, 61\u2013124 (2003)","journal-title":"J. Artif. Intell. Res."},{"key":"12_CR10","unstructured":"Fox, M., Long, D.: Modelling mixed discrete-continuous domains for planning. CoRR abs\/1110.2200 (2011)"},{"key":"12_CR11","unstructured":"Fox, M., Long, D., Tamboise, G., Isangulov, R.: Creating and executing a well construction\/operation plan. uS Patent App. 15\/541,381 (2018)"},{"key":"12_CR12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139583923","volume-title":"Automated Planning and Acting","author":"M Ghallab","year":"2016","unstructured":"Ghallab, M., Nau, D.S., Traverso, P.: Automated Planning and Acting. Cambridge University Press, Cambridge (2016)"},{"key":"12_CR13","unstructured":"Helmert, M.: Decidability and undecidability results for planning with numerical state variables. In: Proceedings of the Sixth International Conference on Artificial Intelligence Planning Systems (AIPS), pp. 44\u201353. AAAI (2002)"},{"issue":"5\u20136","key":"12_CR14","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1016\/j.artint.2008.10.013","volume":"173","author":"M Helmert","year":"2009","unstructured":"Helmert, M.: Concise finite-domain representations for PDDL planning tasks. Artif. Intell. 173(5\u20136), 503\u2013535 (2009)","journal-title":"Artif. Intell."},{"key":"12_CR15","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":"12_CR16","doi-asserted-by":"crossref","unstructured":"Lipovetzky, N., Burt, C.N., Pearce, A.R., Stuckey, P.J.: Planning for mining operations with time and resource constraints. In: Proceedings of the International Conference on Automated Planning and Scheduling (2014)","DOI":"10.1609\/icaps.v24i1.13666"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"McCluskey, T.L., Vallati, M., Franco, S.: Automated planning for urban traffic management. In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), pp. 5238\u20135240 (2017)","DOI":"10.24963\/ijcai.2017\/776"},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"McCluskey, T.L., Vaquero, T.S., Vallati, M.: Engineering knowledge for automated planning: towards a notion of quality. In: Proceedings of the Knowledge Capture Conference, K-CAP, pp. 14:1\u201314:8 (2017)","DOI":"10.1145\/3148011.3148012"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Moore, R.E., Kearfott, R.B., Cloud, M.J.: Introduction to Interval Analysis. SIAM (2009)","DOI":"10.1137\/1.9780898717716"},{"key":"12_CR20","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.engappai.2014.02.002","volume":"30","author":"S Parkinson","year":"2014","unstructured":"Parkinson, S., Longstaff, A., Fletcher, S.: Automated planning to minimise uncertainty of machine tool calibration. Eng. Appl. Artif. Intell. 30, 63\u201372 (2014)","journal-title":"Eng. Appl. Artif. Intell."},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Pnueli, A.: The temporal semantics of concurrent programs. In: Proceedings of Semantics of Concurrent Computation, pp. 1\u201320 (1979)","DOI":"10.1007\/BFb0022460"},{"key":"12_CR22","unstructured":"Raimondi, F., Pecheur, C., Brat, G.: PDVer, a tool to verify PDDL planning domains. In: Proceedings of Workshop on Verification and Validation of Planning and Scheduling Systems, ICAPS (2009)"},{"key":"12_CR23","unstructured":"Scala, E., Haslum, P., Thi\u00e9baux, S.: Heuristics for numeric planning via subgoaling. In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), pp. 3228\u20133234. IJCAI\/AAAI Press (2016)"},{"key":"12_CR24","unstructured":"Scala, E., Haslum, P., Thi\u00e9baux, S., Ram\u00edrez, M.: Interval-based relaxation for general numeric planning. In: Proceedings of the 22nd European Conference on Artificial Intelligence (ECAI), pp. 655\u2013663 (2016)"},{"key":"12_CR25","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1613\/jair.1.11875","volume":"68","author":"E Scala","year":"2020","unstructured":"Scala, E., Haslum, P., Thi\u00e9baux, S., Ram\u00edrez, M.: Subgoaling techniques for satisficing and optimal numeric planning. J. Artif. Intell. Res. 68, 691\u2013752 (2020)","journal-title":"J. Artif. Intell. Res."},{"key":"12_CR26","doi-asserted-by":"crossref","unstructured":"Scala, E., Vallati, M.: Exploiting classical planning grounding in hybrid PDDL+ planning engines. In: Proceedings of the 32nd IEEE International Conference on Tools with Artificial Intelligence (ICTAI), pp. 85\u201392 (2020)","DOI":"10.1109\/ICTAI50040.2020.00024"},{"key":"12_CR27","unstructured":"Shrinah, A., Eder, K.: Goal-constrained planning domain model verification of safety properties. In: STAIRS@ECAI (2020)"},{"key":"12_CR28","unstructured":"Thi\u00e9baux, S., Coffrin, C., Hijazi, H., Slaney, J.: Planning with MIP for supply restoration in power distribution systems. In: Proceedings of the International Joint Conference on Artificial Intelligence (2013)"},{"key":"12_CR29","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, pp. 3188\u20133194 (2016)","DOI":"10.1609\/aaai.v30i1.10399"}],"container-title":["Lecture Notes in Computer Science","AIxIA 2022 \u2013 Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-27181-6_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,10]],"date-time":"2023-03-10T04:36:08Z","timestamp":1678422968000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-27181-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031271809","9783031271816"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-27181-6_12","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":"11 March 2023","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":"Udine","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aiia2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/aixia2022.uniud.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":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"54","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":"33","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":"61% - 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","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)"}},{"value":"This proceeding includes one invited paper.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}