{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:54:55Z","timestamp":1757627695840,"version":"3.44.0"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783032045867"},{"type":"electronic","value":"9783032045874"}],"license":[{"start":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T00:00:00Z","timestamp":1756425600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T00:00:00Z","timestamp":1756425600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-04587-4_14","type":"book-chapter","created":{"date-parts":[[2025,9,2]],"date-time":"2025-09-02T09:28:51Z","timestamp":1756805331000},"page":"223-239","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Towards Practicable Defeasible Reasoning for\u00a0ABoxes"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2618-8721","authenticated-orcid":false,"given":"Jonas","family":"Haldimann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2344-9658","authenticated-orcid":false,"given":"Magdalena","family":"Ortiz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0632-0294","authenticated-orcid":false,"given":"Mantas","family":"\u0160imkus","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,8,29]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-015-7622-2","volume-title":"The Logic of Conditionals: An Application of Probability to Deductive Logic. Synthese Library","author":"EW Adams","year":"1975","unstructured":"Adams, E.W.: The Logic of Conditionals: An Application of Probability to Deductive Logic. Synthese Library. Springer, Dordrecht (1975)"},{"issue":"1","key":"14_CR2","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/BF00883932","volume":"14","author":"F Baader","year":"1995","unstructured":"Baader, F., Hollunder, B.: Embedding defaults into terminological knowledge representation formalisms. J. Autom. Reason. 14(1), 149\u2013180 (1995). https:\/\/doi.org\/10.1007\/BF00883932","journal-title":"J. Autom. Reason."},{"key":"14_CR3","doi-asserted-by":"publisher","DOI":"10.1017\/9781139025355","volume-title":"An Introduction to Description Logic","author":"F Baader","year":"2017","unstructured":"Baader, F., Horrocks, I., Lutz, C., Sattler, U.: An Introduction to Description Logic. Cambridge University Press, Cambridge (2017)"},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/J.ARTINT.2019.04.001","volume":"274","author":"PA Bonatti","year":"2019","unstructured":"Bonatti, P.A.: Rational closure for all description logics. Artif. Intell. 274, 197\u2013223 (2019). https:\/\/doi.org\/10.1016\/J.ARTINT.2019.04.001","journal-title":"Artif. Intell."},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/J.ARTINT.2014.12.010","volume":"222","author":"PA Bonatti","year":"2015","unstructured":"Bonatti, P.A., Faella, M., Petrova, I.M., Sauro, L.: A new semantics for overriding in description logics. Artif. Intell. 222, 1\u201348 (2015). https:\/\/doi.org\/10.1016\/J.ARTINT.2014.12.010","journal-title":"Artif. Intell."},{"key":"14_CR6","doi-asserted-by":"publisher","unstructured":"Booth, R., Varzinczak, I.: Conditional inference under disjunctive rationality. In: Thirty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2021, Thirty-Third Conference on Innovative Applications of Artificial Intelligence, IAAI 2021, The Eleventh Symposium on Educational Advances in Artificial Intelligence, EAAI 2021, Virtual Event, February 2-9, 2021, pp. 6227\u20136234. AAAI Press (2021). https:\/\/doi.org\/10.1609\/AAAI.V35I7.16774","DOI":"10.1609\/AAAI.V35I7.16774"},{"key":"14_CR7","doi-asserted-by":"publisher","unstructured":"Britz, K., Casini, G., Meyer, T., Moodley, K., Sattler, U., Varzinczak, I.: Principles of KLM-style defeasible description logics. ACM Trans. Comput. Log. 22(1), 1:1\u20131:46 (2021). https:\/\/doi.org\/10.1145\/3420258","DOI":"10.1145\/3420258"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/978-3-319-25010-6_27","volume-title":"The Semantic Web - ISWC 2015","author":"G Casini","year":"2015","unstructured":"Casini, G., Meyer, T., Moodley, K., Sattler, U., Varzinczak, I.: Introducing defeasibility into OWL ontologies. In: Arenas, M., et al. (eds.) ISWC 2015. LNCS, vol. 9367, pp. 409\u2013426. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-25010-6_27"},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1613\/JAIR.4062","volume":"48","author":"G Casini","year":"2013","unstructured":"Casini, G., Straccia, U.: Defeasible inheritance-based description logics. J. Artif. Intell. Res. 48, 415\u2013473 (2013). https:\/\/doi.org\/10.1613\/JAIR.4062","journal-title":"J. Artif. Intell. Res."},{"key":"14_CR10","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-030-95070-5_12","volume-title":"Artificial Intelligence Research","author":"G Casini","year":"2022","unstructured":"Casini, G., Straccia, U.: A rational entailment for\u00a0expressive description logics via\u00a0description logic programs. In: Jembere, E., Gerber, A.J., Viriri, S., Pillay, A. (eds.) SACAIR 2021. CCIS, vol. 1551, pp. 177\u2013191. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-95070-5_12"},{"key":"14_CR11","unstructured":"Chama, V., Wang, S., Meyer, T.A., Casini, G.: Defeasible justification for KLM-style logic. In: Giordano, L., Jung, J.C., Ozaki, A. (eds.) Proceedings of the 37th International Workshop on Description Logics (DL 2024), Bergen, Norway, June 18-21, 2024. CEUR Workshop Proceedings, vol.\u00a03739. CEUR-WS.org (2024). https:\/\/ceur-ws.org\/Vol-3739\/paper-3.pdf"},{"issue":"3\u20134","key":"14_CR12","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/BF01536399","volume":"15","author":"T Eiter","year":"1995","unstructured":"Eiter, T., Gottlob, G.: On the computational cost of disjunctive logic programming: propositional case. Ann. Math. Artif. Intell. 15(3\u20134), 289\u2013323 (1995). https:\/\/doi.org\/10.1007\/BF01536399","journal-title":"Ann. Math. Artif. Intell."},{"key":"14_CR13","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.entcs.2011.10.007","volume":"278","author":"E Franconi","year":"2011","unstructured":"Franconi, E., Ib\u00e1\u00f1ez-Garc\u00eda, Y.A., Seylan, \u0130: Query answering with dboxes is hard. Electron. Notes Theor. Comput. Sci. 278, 71\u201384 (2011). https:\/\/doi.org\/10.1016\/j.entcs.2011.10.007. proceedings of the 7th Workshop on Methods for Modalities (M4M '2011) and the 4th Workshop on Logical Aspects of Multi-Agent Systems (LAMAS '2011)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"14_CR14","unstructured":"Giordano, L., Gliozzi, V.: Reasoning about exceptions in ontologies: from the lexicographic closure to the skeptical closure. In: Lukasiewicz, T., Pe\u00f1aloza, R., Turhan, A. (eds.) Proceedings of the Second Workshop on Logics for Reasoning about Preferences, Uncertainty, and Vagueness co-located with the 9th International Joint Conference on Automated Reasoning, PRUV@IJCAR 2018, Oxford, UK, July 19th, 2018. CEUR Workshop Proceedings, vol.\u00a02157. CEUR-WS.org (2018). https:\/\/ceur-ws.org\/Vol-2157\/paper7.pdf"},{"issue":"3\u20134","key":"14_CR15","doi-asserted-by":"publisher","first-page":"235","DOI":"10.3233\/FI-2020-1973","volume":"176","author":"L Giordano","year":"2020","unstructured":"Giordano, L., Gliozzi, V.: Reasoning about exceptions in ontologies: from the lexicographic closure to the skeptical closure. Fundam. Informaticae 176(3\u20134), 235\u2013269 (2020). https:\/\/doi.org\/10.3233\/FI-2020-1973","journal-title":"Fundam. Informaticae"},{"key":"14_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2015.05.001","volume":"226","author":"L Giordano","year":"2015","unstructured":"Giordano, L., Gliozzi, V., Olivetti, N., Pozzato, G.L.: Semantic characterization of rational closure: from propositional logic to description logics. Artif. Intell. 226, 1\u201333 (2015). https:\/\/doi.org\/10.1016\/j.artint.2015.05.001","journal-title":"Artif. Intell."},{"key":"14_CR17","doi-asserted-by":"publisher","unstructured":"Heyninck, J., Kern-Isberner, G., Meyer, T.A., Haldimann, J.P., Beierle, C.: Conditional syntax splitting for non-monotonic inference operators. In: Williams, B., Chen, Y., Neville, J. (eds.) Thirty-Seventh AAAI Conference on Artificial Intelligence, AAAI 2023, Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence, IAAI 2023, Thirteenth Symposium on Educational Advances in Artificial Intelligence, EAAI 2023, Washington, DC, USA, February 7-14, 2023, pp. 6416\u20136424. AAAI Press (2023). https:\/\/doi.org\/10.1609\/aaai.v37i5.25789","DOI":"10.1609\/aaai.v37i5.25789"},{"key":"14_CR18","unstructured":"Knublauch, H., Kontokostas, D.: Shapes constraint language (SHACL). W3C recommendation, W3C (2017). https:\/\/www.w3.org\/TR\/2017\/REC-shacl-20170720\/"},{"issue":"1","key":"14_CR19","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s10472-021-09777-9","volume":"90","author":"C Komo","year":"2021","unstructured":"Komo, C., Beierle, C.: Nonmonotonic reasoning from conditional knowledge bases with system W. Ann. Math. Artif. Intell. 90(1), 107\u2013144 (2021). https:\/\/doi.org\/10.1007\/s10472-021-09777-9","journal-title":"Ann. Math. Artif. Intell."},{"issue":"1\u20132","key":"14_CR20","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0004-3702(90)90101-5","volume":"44","author":"S Kraus","year":"1990","unstructured":"Kraus, S., Lehmann, D., Magidor, M.: Nonmonotonic reasoning, preferential models and cumulative logics. Artif. Intell. 44(1\u20132), 167\u2013207 (1990)","journal-title":"Artif. Intell."},{"key":"14_CR21","unstructured":"Lehmann, D.: What does a conditional knowledge base entail? In: Brachman, R.J., Levesque, H.J., Reiter, R. (eds.) Proceedings of the 1st International Conference on Principles of Knowledge Representation and Reasoning (KR 1989). Toronto, Canada, May 15-18 1989, pp. 212\u2013222. Morgan Kaufmann (1989)"},{"issue":"1","key":"14_CR22","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/BF01535841","volume":"15","author":"D Lehmann","year":"1995","unstructured":"Lehmann, D.: Another perspective on default reasoning. Ann. Math. Artif. Intell. 15(1), 61\u201382 (1995). https:\/\/doi.org\/10.1007\/BF01535841","journal-title":"Ann. Math. Artif. Intell."},{"issue":"3","key":"14_CR23","doi-asserted-by":"publisher","first-page":"23","DOI":"10.23638\/LMCS-15(3:23)2019","volume":"15","author":"C Lutz","year":"2019","unstructured":"Lutz, C., Seylan, I., Wolter, F.: The data complexity of ontology-mediated queries with closed predicates. Logical Methods Comput. Sci. 15(3), 23 (2019). https:\/\/doi.org\/10.23638\/LMCS-15(3:23)2019","journal-title":"Logical Methods Comput. Sci."},{"key":"14_CR24","doi-asserted-by":"publisher","unstructured":"Ortiz, M.: A short introduction to SHACL for logicians. In: Hansen, H.H., Scedrov, A., de\u00a0Queiroz, R.J.G.B. (eds.) Logic, Language, Information, and Computation - 29th International Workshop, WoLLIC 2023, Halifax, NS, Canada, July 11-14, 2023, Proceedings. Lecture Notes in Computer Science, vol. 13923, pp. 19\u201332. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-39784-4_2","DOI":"10.1007\/978-3-031-39784-4_2"},{"key":"14_CR25","unstructured":"Pearl, J.: System Z: A natural ordering of defaults with tractable applications to nonmonotonic reasoning. In: Parikh, R. (ed.) Proceedings of the 3rd Conference on Theoretical Aspects of Reasoning about Knowledge, Pacific Grove, CA, USA, March 1990, pp. 121\u2013135. Morgan Kaufmann (1990)"},{"key":"14_CR26","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/J.IJAR.2018.08.005","volume":"103","author":"M Pensel","year":"2018","unstructured":"Pensel, M., Turhan, A.: Reasoning in the defeasible description logic $$\\epsilon $$ - computing standard inferences under rational and relevant semantics. Int. J. Approx. Reason. 103, 28\u201370 (2018). https:\/\/doi.org\/10.1016\/J.IJAR.2018.08.005","journal-title":"Int. J. Approx. Reason."},{"key":"14_CR27","unstructured":"Schild, K.: A correspondence theory for terminological logics: preliminary report. In: Mylopoulos, J., Reiter, R. (eds.) Proc. of the 12th Int. Joint Conf. on Artificial Intelligence (IJCAI\u00a01991), pp. 466\u2013471. Morgan Kaufmann (1991)"}],"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-032-04587-4_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T04:13:34Z","timestamp":1757477614000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-04587-4_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,29]]},"ISBN":["9783032045867","9783032045874"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-04587-4_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,8,29]]},"assertion":[{"value":"29 August 2025","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":"Kutaisi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Georgia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"jelia2025","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"}}]}}