{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,20]],"date-time":"2025-09-20T20:35:09Z","timestamp":1758400509001,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030757748"},{"type":"electronic","value":"9783030757755"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-75775-5_6","type":"book-chapter","created":{"date-parts":[[2021,5,11]],"date-time":"2021-05-11T23:46:09Z","timestamp":1620776769000},"page":"69-84","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Computing Defeasible Meta-logic"],"prefix":"10.1007","author":[{"given":"Francesco","family":"Olivieri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guido","family":"Governatori","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matteo","family":"Cristani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abdul","family":"Sattar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,5,12]]},"reference":[{"issue":"2","key":"6_CR1","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1145\/371316.371517","volume":"2","author":"G Antoniou","year":"2001","unstructured":"Antoniou, G., Billington, D., Governatori, G., Maher, M.J.: Representation results for defeasible logic. ACM Trans. Comput. Log. 2(2), 255\u2013287 (2001). https:\/\/doi.org\/10.1145\/371316.371517","journal-title":"ACM Trans. Comput. Log."},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/978-3-540-87405-8_15","volume-title":"Graph Transformations","author":"K Azab","year":"2008","unstructured":"Azab, K., Habel, A.: High-level programs and program conditions. In: Ehrig, H., Heckel, R., Rozenberg, G., Taentzer, G. (eds.) ICGT 2008. LNCS, vol. 5214, pp. 211\u2013225. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-87405-8_15"},{"issue":"3","key":"6_CR3","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1145\/1013560.1013566","volume":"5","author":"D Basin","year":"2004","unstructured":"Basin, D., Clavel, M., Meseguer, J.: Reflective metalogical frameworks. ACM Trans. Comput. Logic 5(3), 528\u2013576 (2004). https:\/\/doi.org\/10.1145\/1013560.1013566","journal-title":"ACM Trans. Comput. Logic"},{"key":"6_CR4","doi-asserted-by":"publisher","unstructured":"Cristani, M., Olivieri, F., Rotolo, A.: Changes to temporary norms. In: Keppens, J., Governatori, G. (eds.) ICAIL 2017 pp. 39\u201348. ACM. https:\/\/doi.org\/10.1145\/3086512.3086517","DOI":"10.1145\/3086512.3086517"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-642-01639-4_9","volume-title":"Agent Computing and Multi-Agent Systems","author":"M Dastani","year":"2009","unstructured":"Dastani, M., Governatori, G., Rotolo, A., Song, I., van der Torre, L.: Contextual agent deliberation in defeasible logic. In: Ghose, A., Governatori, G., Sadananda, R. (eds.) PRIMA 2007. LNCS (LNAI), vol. 5044, pp. 98\u2013109. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01639-4_9"},{"key":"6_CR6","doi-asserted-by":"publisher","unstructured":"Dupin De Saint-Cyr, F., Bisquert, P., Cayrol, C., Lagasquie-Schiex, M.C.: Argumentation update in YALLA (yet another logic language for argumentation). Int. J. Approx. Reason. 75, 57\u201392 (2016). https:\/\/doi.org\/10.1016\/j.ijar.2016.04.003","DOI":"10.1016\/j.ijar.2016.04.003"},{"key":"6_CR7","doi-asserted-by":"publisher","unstructured":"Dyoub, A., Costantini, S., De Gasperis, G.: Answer set programming and agents. Knowl. Eng. Rev. 33(1) (2018). https:\/\/doi.org\/10.1017\/S0269888918000164","DOI":"10.1017\/S0269888918000164"},{"issue":"4\u20135","key":"6_CR8","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1017\/S1471068403001753","volume":"3","author":"T Eiter","year":"2003","unstructured":"Eiter, T., Faber, W., Leone, N., Pfeifer, G.: Computing preferred answer sets by meta-interpretation in answer set programming. Theory Pract. Logic Program. 3(4\u20135), 463\u2013498 (2003). https:\/\/doi.org\/10.1017\/S1471068403001753","journal-title":"Theory Pract. Logic Program."},{"key":"6_CR9","doi-asserted-by":"publisher","unstructured":"Gabbay, D.M., Giordano, L., Martelli, A., Olivetti, N.: A language for handling hypothetical updates and inconsistency. Log. J. IGPL 4(3), 385\u2013416 (1996). https:\/\/doi.org\/10.1093\/jigpal\/4.3.385","DOI":"10.1093\/jigpal\/4.3.385"},{"issue":"1\u20132","key":"6_CR10","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s10506-004-1922-2","volume":"12","author":"J Gelati","year":"2004","unstructured":"Gelati, J., Governatori, G., Rotolo, A., Sartor, G.: Normative autonomy and normative co-ordination: declarative power, representation, and mandate. Artif. Intell. Law 12(1\u20132), 53\u201381 (2004)","journal-title":"Artif. Intell. Law"},{"issue":"2","key":"6_CR11","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/S0004-3702(01)00064-9","volume":"127","author":"C Ghidini","year":"2001","unstructured":"Ghidini, C., Giunchiglia, F.: Local models semantics, or contextual reasoning = locality + compatibility. Artif. Intell. 127(2), 221\u2013259 (2001). https:\/\/doi.org\/10.1016\/S0004-3702(01)00064-9","journal-title":"Artif. Intell."},{"issue":"6","key":"6_CR12","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1007\/s10992-013-9295-1","volume":"42","author":"G Governatori","year":"2013","unstructured":"Governatori, G., Olivieri, F., Rotolo, A., Scannapieco, S.: Computing strong and weak permissions in defeasible logic. J. Philos. Logic 42(6), 799\u2013829 (2013). https:\/\/doi.org\/10.1007\/s10992-013-9295-1","journal-title":"J. Philos. Logic"},{"key":"6_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/978-3-642-24908-2_29","volume-title":"Rule - Based Modeling and Computing on the Semantic Web","author":"G Governatori","year":"2011","unstructured":"Governatori, G., Olivieri, F., Scannapieco, S., Cristani, M.: Designing for compliance: norms and goals. In: Olken, F., Palmirani, M., Sottara, D. (eds.) RuleML 2011. LNCS, vol. 7018, pp. 282\u2013297. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24908-2_29"},{"issue":"3","key":"6_CR14","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1017\/S1471068416000053","volume":"16","author":"G Governatori","year":"2016","unstructured":"Governatori, G., Olivieri, F., Scannapieco, S., Rotolo, A., Cristani, M.: The rationale behind the concept of goal. Theory Pract. Log. Program. 16(3), 296\u2013324 (2016). https:\/\/doi.org\/10.1017\/S1471068416000053","journal-title":"Theory Pract. Log. Program."},{"issue":"3","key":"6_CR15","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1093\/jigpal\/jzp006","volume":"17","author":"G Governatori","year":"2009","unstructured":"Governatori, G., Padmanabhan, V., Rotolo, A., Sattar, A.: A defeasible logic for modelling policy-based intentions and motivational attitudes. Log. J. IGPL 17(3), 227\u2013265 (2009). https:\/\/doi.org\/10.1093\/jigpal\/jzp006","journal-title":"Log. J. IGPL"},{"issue":"1","key":"6_CR16","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1093\/jigpal\/jzp075","volume":"18","author":"G Governatori","year":"2010","unstructured":"Governatori, G., Rotolo, A.: Changing legal systems: legal abrogations and annulments in defeasible logic. Log. J. IGPL 18(1), 157\u2013194 (2010)","journal-title":"Log. J. IGPL"},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/BFb0054789","volume-title":"Logic Programming and Knowledge Representation","author":"S Greco","year":"1998","unstructured":"Greco, S., Leone, N., Scarcello, F.: Datalog with nested rules. In: Dix, J., Pereira, L.M., Przymusinski, T.C. (eds.) LPKR 1997. LNCS, vol. 1471, pp. 52\u201365. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054789"},{"issue":"3","key":"6_CR18","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1093\/jigpal\/4.3.427","volume":"4","author":"AJI Jones","year":"1996","unstructured":"Jones, A.J.I., Sergot, M.J.: A formal characterisation of institutionalised power. Log. J. IGPL 4(3), 427\u2013443 (1996). https:\/\/doi.org\/10.1093\/jigpal\/4.3.427","journal-title":"Log. J. IGPL"},{"key":"6_CR19","doi-asserted-by":"publisher","unstructured":"Kravari, K., Bassiliades, N.: A survey of agent platforms. J. Artif. Soc. Soc. Simul. 18(1), \u00a011 (2015). https:\/\/doi.org\/10.18564\/jasss.2661","DOI":"10.18564\/jasss.2661"},{"issue":"3","key":"6_CR20","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1023\/A:1018978005636","volume":"25","author":"V Lifschitz","year":"1999","unstructured":"Lifschitz, V., Tang, L.R., Turner, H.: Nested expressions in logic programs. Ann. Math. Artif. Intell. 25(3), 369\u2013389 (1999). https:\/\/doi.org\/10.1023\/A:1018978005636","journal-title":"Ann. Math. Artif. Intell."},{"issue":"3","key":"6_CR21","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0743-1066(84)90011-6","volume":"1","author":"JW Lloyd","year":"1984","unstructured":"Lloyd, J.W., Topor, R.W.: Making prolog more expressive. J. Logic Program. 1(3), 225\u2013240 (1984). https:\/\/doi.org\/10.1016\/0743-1066(84)90011-6","journal-title":"J. Logic Program."},{"issue":"4","key":"6_CR22","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1023\/A:1004748624537","volume":"29","author":"D Makinson","year":"2000","unstructured":"Makinson, D., Van Der Torre, L.: Input\/output logics. J. Philos. Logic 29(4), 383\u2013408 (2000)","journal-title":"J. Philos. Logic"},{"issue":"6","key":"6_CR23","doi-asserted-by":"publisher","first-page":"959","DOI":"10.1093\/logcom\/exq054","volume":"21","author":"S Modgil","year":"2011","unstructured":"Modgil, S., Bench-Capon, T.: Metalevel argumentation. J. Logic Comput. 21(6), 959\u20131003 (2011). https:\/\/doi.org\/10.1093\/logcom\/exq054","journal-title":"J. Logic Comput."},{"key":"6_CR24","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1007\/978-3-319-25524-8_43","volume-title":"PRIMA 2015: Principles and Practice of Multi-Agent Systems","author":"F Olivieri","year":"2015","unstructured":"Olivieri, F., Cristani, M., Governatori, G.: Compliant business processes with exclusive choices from agent specification. In: Chen, Q., Torroni, P., Villata, S., Hsu, J., Omicini, A. (eds.) PRIMA 2015. LNCS (LNAI), vol. 9387, pp. 603\u2013612. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-25524-8_43"},{"key":"6_CR25","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-642-44927-7_15","volume-title":"PRIMA 2013: Principles and Practice of Multi-Agent Systems","author":"F Olivieri","year":"2013","unstructured":"Olivieri, F., Governatori, G., Scannapieco, S., Cristani, M.: Compliant business process design by declarative specifications. In: Boella, G., Elkind, E., Savarimuthu, B.T.R., Dignum, F., Purvis, M.K. (eds.) PRIMA 2013. LNCS (LNAI), vol. 8291, pp. 213\u2013228. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-44927-7_15"},{"key":"6_CR26","unstructured":"Sartor, G.: Legal Reasoning: A Cognitive Approach to the Law. Springer (2005)"},{"key":"6_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/11580072_18","volume-title":"Rules and Rule Markup Languages for the Semantic Web","author":"I Song","year":"2005","unstructured":"Song, I., Governatori, G.: Nested rules in defeasible logic. In: Adi, A., Stoutenburg, S., Tabet, S. (eds.) RuleML 2005. LNCS, vol. 3791, pp. 204\u2013208. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11580072_18"}],"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-030-75775-5_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,11]],"date-time":"2021-05-11T23:46:50Z","timestamp":1620776810000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-75775-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030757748","9783030757755"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-75775-5_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"12 May 2021","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 May 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 May 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"jelia2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/jelia2021.aau.at\/","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":"68","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":"27","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":"3","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":"40% - 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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to the Corona pandemic this event was held virtually.","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)"}}]}}