{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T23:15:28Z","timestamp":1742944528496,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"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_16","type":"book-chapter","created":{"date-parts":[[2023,9,23]],"date-time":"2023-09-23T15:02:40Z","timestamp":1695481360000},"page":"227-242","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Comparing Planning Domain Models Using Answer Set Programming"],"prefix":"10.1007","author":[{"given":"Luk\u00e1\u0161","family":"Chrpa","sequence":"first","affiliation":[]},{"given":"Carmine","family":"Dodaro","sequence":"additional","affiliation":[]},{"given":"Marco","family":"Maratea","sequence":"additional","affiliation":[]},{"given":"Marco","family":"Mochi","sequence":"additional","affiliation":[]},{"given":"Mauro","family":"Vallati","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,9,24]]},"reference":[{"issue":"1","key":"16_CR1","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1109\/MIS.2004.1265878","volume":"19","author":"M Ai-Chang","year":"2004","unstructured":"Ai-Chang, M., et al.: MAPGEN: mixed-initiative planning and scheduling for the mars exploration rover mission. IEEE Intell. Syst. 19(1), 8\u201312 (2004)","journal-title":"IEEE Intell. Syst."},{"key":"16_CR2","unstructured":"Alviano, M., Dodaro, C., Previti, A.: Python Specification Language (2021). https:\/\/github.com\/dodaro\/pyspel"},{"key":"16_CR3","doi-asserted-by":"publisher","unstructured":"Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, Cambridge (2003). https:\/\/doi.org\/10.1017\/CBO9780511543357","DOI":"10.1017\/CBO9780511543357"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Bengoetxea, E.: Inexact Graph Matching Using Estimation of Distribution Algorithms. Ph.D. thesis, Ecole Nationale Sup\u00e9rieure des T\u00e9l\u00e9communications, Paris, France, December 2002","DOI":"10.1016\/S0031-3203(01)00232-1"},{"issue":"12","key":"16_CR5","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1145\/2043174.2043195","volume":"54","author":"G Brewka","year":"2011","unstructured":"Brewka, G., Eiter, T., Truszczynski, M.: Answer set programming at a glance. Commun. ACM 54(12), 92\u2013103 (2011)","journal-title":"Commun. ACM"},{"issue":"2","key":"16_CR6","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1017\/S1471068419000450","volume":"20","author":"F Calimeri","year":"2020","unstructured":"Calimeri, F., et al.: ASP-Core-2 input language format. Theory Pract. Log. Program. 20(2), 294\u2013309 (2020)","journal-title":"Theory Pract. Log. Program."},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Cardellini, M., Maratea, M., Vallati, M., Boleto, G., Oneto, L.: In-station train dispatching: a PDDL+ planning approach. In: Proceedings of ICAPS, pp. 450\u2013458 (2021)","DOI":"10.1609\/icaps.v31i1.15991"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Chakraborti, T., Sreedharan, S., Zhang, Y., Kambhampati, S.: Plan explanations as model reconciliation: moving beyond explanation as soliloquy. In: Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI, pp. 156\u2013163 (2017)","DOI":"10.24963\/ijcai.2017\/23"},{"issue":"1","key":"16_CR9","first-page":"104","volume":"38","author":"L Chrpa","year":"2017","unstructured":"Chrpa, L., McCluskey, T.L., Vallati, M., Vaquero, T.: The fifth international competition on knowledge engineering for planning and scheduling: summary and trends. AI Mag. 38(1), 104\u2013106 (2017)","journal-title":"AI Mag."},{"key":"16_CR10","unstructured":"Coulter, A., Ilie, T., Tibando, R., Muise, C.: Theory alignment via a classical encoding of regular bisimulation. In: Workshop on Knowledge Engineering for Planning and Scheduling (KEPS) (2022)"},{"issue":"2","key":"16_CR11","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1017\/S0269888912000422","volume":"28","author":"S Cresswell","year":"2013","unstructured":"Cresswell, S., McCluskey, T.L., West, M.M.: Acquiring planning domain models using LOCM. Knowl. Eng. Rev. 28(2), 195\u2013213 (2013)","journal-title":"Knowl. Eng. Rev."},{"key":"16_CR12","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":"16_CR13","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Ostrowski, M., Schaub, T., Wanko, P.: Theory solving made easy with Clingo 5. In: ICLP (Technical Communications). OASICS, vol. 52, pp. 2:1\u20132:15 (2016)"},{"issue":"3\/4","key":"16_CR14","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF03037169","volume":"9","author":"M Gelfond","year":"1991","unstructured":"Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. N. Gener. Comput. 9(3\/4), 365\u2013386 (1991)","journal-title":"N. Gener. Comput."},{"issue":"5\u20136","key":"16_CR15","doi-asserted-by":"publisher","first-page":"872","DOI":"10.1017\/S1471068417000242","volume":"17","author":"T Janhunen","year":"2017","unstructured":"Janhunen, T., Kaminski, R., Ostrowski, M., Schellhorn, S., Wanko, P., Schaub, T.: Clingo goes linear constraints over reals and integers. Theory Pract. Log. Program. 17(5\u20136), 872\u2013888 (2017)","journal-title":"Theory Pract. Log. Program."},{"issue":"1","key":"16_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0004-3702(97)00034-9","volume":"95","author":"TL McCluskey","year":"1997","unstructured":"McCluskey, T.L., Porteous, J.M.: Engineering and compiling planning domain models to promote validity and efficiency. Artif. Intell. 95(1), 1\u201365 (1997)","journal-title":"Artif. Intell."},{"key":"16_CR17","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 K-CAP, pp. 14:1\u201314:8 (2017)","DOI":"10.1145\/3148011.3148012"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"Nguyen, V., Son, T.C., Yeoh, W.: Explainable problem in clingo-dl programs. In: Ma, H., Serina, I. (eds.) Proceedings of the Fourteenth International Symposium on Combinatorial Search (SOCS 2021), pp. 231\u2013232. AAAI Press (2021)","DOI":"10.1609\/socs.v12i1.18593"},{"key":"16_CR19","doi-asserted-by":"crossref","unstructured":"Nguyen, V., Stylianos, V.L., Son, T.C., Yeoh, W.: Explainable planning using answer set programming. In: Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, KR, pp. 662\u2013666 (2020)","DOI":"10.24963\/kr.2020\/66"},{"issue":"3\u20134","key":"16_CR20","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1023\/A:1018930122475","volume":"25","author":"I Niemel\u00e4","year":"1999","unstructured":"Niemel\u00e4, I.: Logic programs with stable model semantics as a constraint programming paradigm. Ann. Math. Artif. Intell. 25(3\u20134), 241\u2013273 (1999)","journal-title":"Ann. Math. Artif. Intell."},{"key":"16_CR21","unstructured":"Ram\u00edrez, M., et al.: Integrated hybrid planning and programmed control for real time UAV maneuvering. In: Proceedings of the AAMAS, pp. 1318\u20131326 (2018)"},{"key":"16_CR22","doi-asserted-by":"publisher","unstructured":"Sanfeliu, A., Fu, K.: A distance measure between attributed relational graphs for pattern recognition. IEEE Trans. Syst. Man Cybern. 13(3), 353\u2013362 (1983). https:\/\/doi.org\/10.1109\/TSMC.1983.6313167","DOI":"10.1109\/TSMC.1983.6313167"},{"key":"16_CR23","unstructured":"Shah, M.M.S., Chrpa, L., Kitchin, D.E., McCluskey, T.L., Vallati, M.: Exploring knowledge engineering strategies in designing and modelling a road traffic accident management domain. In: Proceedings of the 23rd International Joint Conference on Artificial Intelligence, pp. 2373\u20132379 (2013)"},{"key":"16_CR24","unstructured":"Shoeeb, S., McCluskey, T.: On comparing planning domain models. In: PlanSIG Workshop (2011)"},{"key":"16_CR25","unstructured":"Shrinah, A., Long, D., Eder, K.: D-VAL: an automatic functional equivalence validation tool for planning domain models. arXiv preprint arXiv:2104.14602 (2021)"},{"key":"16_CR26","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/978-3-030-75775-5_26","volume-title":"Logics in Artificial Intelligence","author":"TC Son","year":"2021","unstructured":"Son, T.C., Nguyen, V., Vasileiou, S.L., Yeoh, W.: Model reconciliation in logic programs. In: Faber, W., Friedrich, G., Gebser, M., Morak, M. (eds.) JELIA 2021. LNCS (LNAI), vol. 12678, pp. 393\u2013406. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-75775-5_26"},{"key":"16_CR27","doi-asserted-by":"crossref","unstructured":"Vallati, M., Chrpa, L.: On the robustness of domain-independent planning engines: the impact of poorly-engineered knowledge. In: Proceedings of K-CAP, pp. 197\u2013204 (2019)","DOI":"10.1145\/3360901.3364416"},{"key":"16_CR28","doi-asserted-by":"crossref","unstructured":"Vallati, M., McCluskey, T.L.: A quality framework for automated planning knowledge models. In: Proceedings of the 13th International Conference on Agents and Artificial Intelligence, ICAART, pp. 635\u2013644 (2021)","DOI":"10.5220\/0010216806350644"},{"issue":"1","key":"16_CR29","doi-asserted-by":"publisher","first-page":"25","DOI":"10.14778\/1687627.1687631","volume":"2","author":"Z Zeng","year":"2009","unstructured":"Zeng, Z., Tung, A.K.H., Wang, J., Feng, J., Zhou, L.: Comparing stars: on approximating graph edit distance. Proc. VLDB Endow. 2(1), 25\u201336 (2009)","journal-title":"Proc. VLDB Endow."}],"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_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,23]],"date-time":"2023-09-23T15:05:52Z","timestamp":1695481552000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43619-2_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031436185","9783031436192"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43619-2_16","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)"}}]}}