{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T00:38:27Z","timestamp":1783643907777,"version":"3.55.0"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031164736","type":"print"},{"value":"9783031164743","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-16474-3_54","type":"book-chapter","created":{"date-parts":[[2022,9,12]],"date-time":"2022-09-12T14:16:28Z","timestamp":1662992188000},"page":"663-675","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Almost Certain Termination for\u00a0$$\\mathcal {ALC}$$ Weakening"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0936-2123","authenticated-orcid":false,"given":"Roberto","family":"Confalonieri","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2544-5332","authenticated-orcid":false,"given":"Pietro","family":"Galliani","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1517-7354","authenticated-orcid":false,"given":"Oliver","family":"Kutz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3655-0218","authenticated-orcid":false,"given":"Daniele","family":"Porello","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4027-5434","authenticated-orcid":false,"given":"Guendalina","family":"Righetti","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5763-6080","authenticated-orcid":false,"given":"Nicolas","family":"Troquard","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,9,13]]},"reference":[{"key":"54_CR1","volume-title":"The Description Logic Handbook: Theory, Implementation, and Applications","year":"2003","unstructured":"Baader, F., Calvanese, D., McGuinness, D.L., Nardi, D., Patel-Schneider, P.F. (eds.): The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press, New York (2003)"},{"key":"54_CR2","unstructured":"Baader, F., Kriegel, F., Nuradiansyah, A., Pe\u00f1aloza, R.: Making repairs in description logics more gentle. In: Proceedings of KR 2018, pp. 319\u2013328 (2018)"},{"key":"54_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/0-387-31072-X_1","volume-title":"Mathematical Problems from Applied Logic I: Logics for the XXIst Century","author":"F Baader","year":"2006","unstructured":"Baader, F., K\u00fcsters, R.: Nonstandard inferences in description logics: the story so far. In: Gabbay, D.M., Goncharov, S.S., Zakharyaschev, M. (eds.) Mathematical Problems from Applied Logic I: Logics for the XXIst Century, pp. 1\u201375. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/0-387-31072-X_1"},{"key":"54_CR4","doi-asserted-by":"publisher","unstructured":"Baader, F., Pe\u00f1aloza, R., Suntisrivaraporn, B.: Pinpointing in the description logic $$\\cal{EL}^+$$. In: Hertzberg, J., Beetz, M., Englert, R. (eds.) KI 2007. LNCS (LNAI), vol. 4667, pp. 52\u201367. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74565-5_7","DOI":"10.1007\/978-3-540-74565-5_7"},{"key":"54_CR5","doi-asserted-by":"publisher","unstructured":"Badea, L., Nienhuys-Cheng, S.-H.: A refinement operator for description logics. In: Cussens, J., Frisch, A. (eds.) ILP 2000. LNCS (LNAI), vol. 1866, pp. 40\u201359. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44960-4_3","DOI":"10.1007\/3-540-44960-4_3"},{"issue":"1\u20133","key":"54_CR6","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s10472-016-9524-8","volume":"82","author":"R Confalonieri","year":"2018","unstructured":"Confalonieri, R., Eppe, M., Schorlemmer, M., Kutz, O., Pe\u00f1aloza, R., Plaza, E.: Upward refinement operators for conceptual blending in the description logic $$\\cal{EL} ^{++}$$. Ann. Math. Artif. Intell. 82(1\u20133), 69\u201399 (2018)","journal-title":"Ann. Math. Artif. Intell."},{"key":"54_CR7","unstructured":"Confalonieri, R., Galliani, P., Kutz, O., Porello, D., Righetti, G., Troquard, N.: Towards even more irresistible axiom weakening. In: Borgwardt, S., Meyer, T. (eds.) Proceedings of the 33rd International Workshop on Description Logics (DL 2020) co-located with the 17th International Conference on Principles of Knowledge Representation and Reasoning (KR 2020), Online Event, Rhodes, Greece, 12\u201314 September 2020. CEUR Workshop Proceedings, vol. 2663. CEUR-WS.org (2020). http:\/\/ceur-ws.org\/Vol-2663\/paper-8.pdf"},{"key":"54_CR8","doi-asserted-by":"crossref","unstructured":"Du, J., Qi, G., Fu, X.: A practical fine-grained approach to resolving incoherent OWL 2 DL terminologies. In: Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management, pp. 919\u2013928 (2014)","DOI":"10.1145\/2661829.2662046"},{"key":"54_CR9","doi-asserted-by":"publisher","unstructured":"Kalyanpur, A., Parsia, B., Sirin, E., Cuenca-Grau, B.: Repairing unsatisfiable concepts in OWL ontologies. In: Sure, Y., Domingue, J. (eds.) ESWC 2006. LNCS, vol. 4011, pp. 170\u2013184. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11762256_15","DOI":"10.1007\/11762256_15"},{"issue":"4","key":"54_CR10","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1016\/j.websem.2005.09.005","volume":"3","author":"A Kalyanpur","year":"2005","unstructured":"Kalyanpur, A., Parsia, B., Sirin, E., Hendler, J.: Debugging unsatisfiable classes in OWL ontologies. Web Semant.: Sci. Serv. Agents World Wide Web 3(4), 268\u2013293 (2005)","journal-title":"Web Semant.: Sci. Serv. Agents World Wide Web"},{"issue":"3","key":"54_CR11","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/S0743-1066(97)00077-0","volume":"34","author":"PR van der Laag","year":"1998","unstructured":"van der Laag, P.R., Nienhuys-Cheng, S.H.: Completeness and properness of refinement operators in inductive logic programming. J. Logic Program. 34(3), 201\u2013225 (1998)","journal-title":"J. Logic Program."},{"key":"54_CR12","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-540-78469-2_18","volume-title":"Inductive Logic Programming","author":"J Lehmann","year":"2008","unstructured":"Lehmann, J., Hitzler, P.: Foundations of refinement operators for description logics. In: Blockeel, H., Ramon, J., Shavlik, J., Tadepalli, P. (eds.) ILP 2007. LNCS (LNAI), vol. 4894, pp. 161\u2013174. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78469-2_18"},{"key":"54_CR13","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-540-78469-2_17","volume-title":"Inductive Logic Programming","author":"J Lehmann","year":"2008","unstructured":"Lehmann, J., Hitzler, P.: A refinement operator based learning algorithm for the $$\\cal{ALC}$$ description logic. In: Blockeel, H., Ramon, J., Shavlik, J., Tadepalli, P. (eds.) ILP 2007. LNCS (LNAI), vol. 4894, pp. 147\u2013160. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78469-2_17"},{"issue":"1\u20132","key":"54_CR14","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s10994-009-5146-2","volume":"78","author":"J Lehmann","year":"2010","unstructured":"Lehmann, J., Hitzler, P.: Concept learning in description logics using refinement operators. Mach. Learn. 78(1\u20132), 203\u2013250 (2010)","journal-title":"Mach. Learn."},{"key":"54_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-642-15918-3_9","volume-title":"Web Reasoning and Rule Systems","author":"D Lembo","year":"2010","unstructured":"Lembo, D., Lenzerini, M., Rosati, R., Ruzzi, M., Savo, D.F.: Inconsistency-tolerant semantics for description logics. In: Hitzler, P., Lukasiewicz, T. (eds.) RR 2010. LNCS, vol. 6333, pp. 103\u2013117. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15918-3_9"},{"issue":"4","key":"54_CR16","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1145\/2757001.2757003","volume":"1","author":"MA Musen","year":"2015","unstructured":"Musen, M.A.: The Prot\u00e9g\u00e9 project: a look back and a look forward. AI Matters 1(4), 4\u201312 (2015)","journal-title":"AI Matters"},{"key":"54_CR17","doi-asserted-by":"crossref","unstructured":"Porello, D., Troquard, N., Pe\u00f1aloza, R., Confalonieri, R., Galliani, P., Kutz, O.: Two approaches to ontology aggregation based on axiom weakening. In: Lang, J. (ed.) Proceedings of the 27th International Joint Conference on Artificial Intelligence, IJCAI 2018, Stockholm, Sweden, 13\u201319 July 2018, pp. 1942\u20131948 (2018)","DOI":"10.24963\/ijcai.2018\/268"},{"key":"54_CR18","unstructured":"Schlobach, S., Cornet, R.: Non-standard reasoning services for the debugging of description logic terminologies. In: Proceedings of IJCAI 2003, pp. 355\u2013362. Morgan Kaufmann (2003)"},{"key":"54_CR19","doi-asserted-by":"crossref","unstructured":"Troquard, N., Confalonieri, R., Galliani, P., Pe\u00f1aloza, R., Porello, D., Kutz, O.: Repairing ontologies via axiom weakening. In: McIlraith, S.A., Weinberger, K.Q. (eds.) Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, (AAAI 2018), pp. 1981\u20131988. AAAI Press (2018)","DOI":"10.1609\/aaai.v32i1.11567"}],"container-title":["Lecture Notes in Computer Science","Progress in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-16474-3_54","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,12]],"date-time":"2022-09-12T14:24:56Z","timestamp":1662992696000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-16474-3_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031164736","9783031164743"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-16474-3_54","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"13 September 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EPIA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"EPIA Conference on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lisbon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","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":"31 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 September 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":"epia2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/epia2022.inesc-id.pt\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"85","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":"64","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":"75% - 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,7","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":"0,9","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)"}}]}}