{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T16:04:15Z","timestamp":1743005055030,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"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_43","type":"book-chapter","created":{"date-parts":[[2023,9,23]],"date-time":"2023-09-23T15:02:40Z","timestamp":1695481360000},"page":"638-646","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Plan Selection Framework for\u00a0Policy-Aware Autonomous Agents"],"prefix":"10.1007","author":[{"given":"Charles","family":"Harders","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4534-9658","authenticated-orcid":false,"given":"Daniela","family":"Inclezan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,24]]},"reference":[{"key":"43_CR1","unstructured":"Balduccini, M., Gelfond, M.: The AAA architecture: an overview. In: Architectures for Intelligent Theory-Based Agents, Papers from the 2008 AAAI Spring Symposium, 2008, pp. 1\u20136. AAAI Press (2008)"},{"key":"43_CR2","doi-asserted-by":"publisher","unstructured":"Blount, J., Gelfond, M., Balduccini, M.: A theory of intentions for intelligent agents - (extended abstract). In: Calimeri, F., Ianni, G., Truszczynski, M. (eds.) Logic Programming and Nonmonotonic Reasoning. LPNMR 2015. LNCS, vol. 9345, pp. 134\u2013142. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23264-5_12","DOI":"10.1007\/978-3-319-23264-5_12"},{"issue":"2","key":"43_CR3","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":"43_CR4","doi-asserted-by":"crossref","unstructured":"Craven, R., Lobo, J., Ma, J., Russo, A., Lupu, E., Bandara, A.: Expressive policy analysis with enhanced system dynamicity. In: Proceedings of the 4th International Symposium on Information, Computer, and Communications Security, pp. 239\u2013250. ASIACCS \u201909, Association for Computing Machinery, New York, NY, USA (2009)","DOI":"10.1145\/1533057.1533091"},{"issue":"1\u20132","key":"43_CR5","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/S0004-3702(02)00367-3","volume":"144","author":"T Eiter","year":"2003","unstructured":"Eiter, T., Faber, W., Leone, N., Pfeifer, G., Polleres, A.: A logic programming approach to knowledge-state planning, II: the DLV$${}^{\\text{ k }}$$ system. Artif. Intell. 144(1\u20132), 157\u2013211 (2003)","journal-title":"Artif. Intell."},{"key":"43_CR6","unstructured":"Gebser, M., et al.: Potassco user guide, 2 ed. University of Potsdam (2015)"},{"issue":"1\u20132","key":"43_CR7","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1080\/11663081.2013.798954","volume":"23","author":"M Gelfond","year":"2013","unstructured":"Gelfond, M., Inclezan, D.: Some properties of system descriptions of ALd. J. Appl. Non Class. Log. 23(1\u20132), 105\u2013120 (2013)","journal-title":"J. Appl. Non Class. Log."},{"key":"43_CR8","doi-asserted-by":"crossref","unstructured":"Gelfond, M., Kahl, Y.: Knowledge Representation, Reasoning, and the Design of Intelligent Agents. Cambridge University Press, Cambridge (2014)","DOI":"10.1017\/CBO9781139342124"},{"key":"43_CR9","unstructured":"Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proceedings of the International Conference on Logic Programming (ICLP88), pp. 1070\u20131080 (1988)"},{"issue":"3\/4","key":"43_CR10","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":"16","key":"43_CR11","first-page":"193","volume":"3","author":"M Gelfond","year":"1998","unstructured":"Gelfond, M., Lifschitz, V.: Action languages. Electron. Trans. AI 3(16), 193\u2013210 (1998)","journal-title":"Electron. Trans. AI"},{"key":"43_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/978-3-540-89982-2_7","volume-title":"Logic Programming","author":"M Gelfond","year":"2008","unstructured":"Gelfond, M., Lobo, J.: Authorization and obligation policies in dynamic systems. In: Garcia de la Banda, M., Pontelli, E. (eds.) ICLP 2008. LNCS, vol. 5366, pp. 22\u201336. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-89982-2_7"},{"key":"43_CR13","doi-asserted-by":"publisher","unstructured":"Inclezan, D.: An ASP framework for the refinement of authorization and obligation policies. Theory Pract. Log. Program. 1\u201316 (2023). https:\/\/doi.org\/10.1017\/S147106842300011X","DOI":"10.1017\/S147106842300011X"},{"key":"43_CR14","unstructured":"Lifschitz, V.: Answer set planning. In: Schreye, D.D. (ed.) Logic Programming: The 1999 International Conference, Las Cruces, New Mexico, USA, November 29\u2013 4 December 1999, pp. 23\u201337. MIT Press (1999)"},{"key":"43_CR15","doi-asserted-by":"publisher","unstructured":"Marek, V.W., Truszczynski, M.: Stable models and an alternative logic programming paradigm. In: Apt, K.R., Marek, V.W., Truszczynski, M., Warren, D.S. (eds.) The Logic Programming Paradigm. Artificial Intelligence, pp. 375\u2013398. Springer, Berlin, Heidelberg (1999). https:\/\/doi.org\/10.1007\/978-3-642-60085-2_17","DOI":"10.1007\/978-3-642-60085-2_17"},{"key":"43_CR16","doi-asserted-by":"crossref","unstructured":"Meyer, J., Inclezan, D.: APIA: an architecture for policy-aware intentional agents. In: Formisano, A., et al. (eds.) Proceedings 37th International Conference on Logic Programming (Technical Communications), ICLP Technical Communications 2021, Porto (virtual event), 20\u201327th September 2021. EPTCS, vol. 345, pp. 84\u201398 (2021)","DOI":"10.4204\/EPTCS.345.23"},{"issue":"5","key":"43_CR17","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1017\/S1471068406002717","volume":"6","author":"TC Son","year":"2006","unstructured":"Son, T.C., Pontelli, E.: Planning with preferences using logic programming. Theory Pract. Log. Program. 6(5), 559\u2013607 (2006)","journal-title":"Theory Pract. Log. Program."},{"issue":"1","key":"43_CR18","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1017\/S1471068422000072","volume":"23","author":"TC Son","year":"2023","unstructured":"Son, T.C., Pontelli, E., Balduccini, M., Schaub, T.: Answer set planning: a survey. Theory Pract. Log. Program. 23(1), 226\u2013298 (2023)","journal-title":"Theory Pract. Log. Program."},{"key":"43_CR19","unstructured":"Son, T.C., Tu, P.H., Gelfond, M., Morales, A.R.: Conformant planning for domains with constraints-a new approach. 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. 1211\u20131216. AAAI Press\/The MIT Press (2005)"},{"issue":"1","key":"43_CR20","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.artint.2010.04.007","volume":"175","author":"PH Tu","year":"2011","unstructured":"Tu, P.H., Son, T.C., Gelfond, M., Morales, A.R.: Approximation of action theories and its application to conformant planning. Artif. Intell. 175(1), 79\u2013119 (2011)","journal-title":"Artif. Intell."}],"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_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,23]],"date-time":"2023-09-23T15:09:45Z","timestamp":1695481785000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43619-2_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031436185","9783031436192"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43619-2_43","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)"}}]}}