{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T22:22:59Z","timestamp":1775082179073,"version":"3.50.1"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031069802","type":"print"},{"value":"9783031069819","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.springernature.com\/gp\/researchers\/text-and-data-mining"},{"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.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-06981-9_8","type":"book-chapter","created":{"date-parts":[[2022,5,30]],"date-time":"2022-05-30T19:02:40Z","timestamp":1653937360000},"page":"130-146","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Optimal ABox Repair w.r.t. Static $$\\mathcal {EL}$$ TBoxes: From Quantified ABoxes Back to\u00a0ABoxes"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4049-221X","authenticated-orcid":false,"given":"Franz","family":"Baader","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5999-2583","authenticated-orcid":false,"given":"Patrick","family":"Koopmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0219-0330","authenticated-orcid":false,"given":"Francesco","family":"Kriegel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9047-7624","authenticated-orcid":false,"given":"Adrian","family":"Nuradiansyah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,5,31]]},"reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-540-30559-0_15","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"F Baader","year":"2004","unstructured":"Baader, F.: A graph-theoretic generalization of the least common subsumer and the most specific concept in the description logic $$\\cal{EL}$$. In: Hromkovi\u010d, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol. 3353, pp. 177\u2013188. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30559-0_15"},{"key":"8_CR2","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). https:\/\/doi.org\/10.1017\/9781139025355"},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/978-3-030-79876-5_18","volume-title":"Automated Deduction \u2013 CADE 28","author":"F Baader","year":"2021","unstructured":"Baader, F., Koopmann, P., Kriegel, F., Nuradiansyah, A.: Computing optimal repairs of quantified ABoxes w.r.t. static $$\\cal{EL}$$ TBoxes. In: Platzer, A., Sutcliffe, G. (eds.) CADE 2021. LNCS (LNAI), vol. 12699, pp. 309\u2013326. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-79876-5_18"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Baader, F., Koopmann, P., Kriegel, F., Nuradiansyah, A.: Optimal ABox repair w.r.t. static $$\\cal{EL}$$ TBoxes: from quantified ABoxes back to ABoxes (extended version). LTCS-Report 22\u201301, Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universit\u00e4t Dresden, Dresden, Germany (2022). https:\/\/doi.org\/10.25368\/2022.65","DOI":"10.25368\/2022.65"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/978-3-030-19570-0_21","volume-title":"Logics in Artificial Intelligence","author":"F Baader","year":"2019","unstructured":"Baader, F., Kriegel, F., Nuradiansyah, A.: Privacy-preserving ontology publishing for $$\\cal{EL} $$ instance stores. In: Calimeri, F., Leone, N., Manna, M. (eds.) JELIA 2019. LNCS (LNAI), vol. 11468, pp. 323\u2013338. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-19570-0_21"},{"key":"8_CR6","unstructured":"Baader, F., Kriegel, F., Nuradiansyah, A., Pe\u00f1aloza, R.: Making repairs in description logics more gentle. In: Principles of Knowledge Representation and Reasoning: Proceedings of the Sixteenth International Conference, KR 2018, Tempe, Arizona, 30 October\u20132 November 2018, pp. 319\u2013328. AAAI Press (2018). https:\/\/aaai.org\/ocs\/index.php\/KR\/KR18\/paper\/view\/18056"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-62419-4_1","volume-title":"The Semantic Web \u2013 ISWC 2020","author":"F Baader","year":"2020","unstructured":"Baader, F., Kriegel, F., Nuradiansyah, A., Pe\u00f1aloza, R.: Computing compliant anonymisations of quantified ABoxes w.r.t. $$\\cal{EL} $$ policies. In: Pan, J.Z., et al. (eds.) ISWC 2020. LNCS, vol. 12506, pp. 3\u201320. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-62419-4_1"},{"key":"8_CR8","unstructured":"Baader, F., Suntisrivaraporn, B.: Debugging SNOMED CT using axiom pinpointing in the description logic $$\\cal{EL}^+$$. In: Proceedings of the Third International Conference on Knowledge Representation in Medicine, Phoenix, Arizona, USA, 31 May\u20132 June 2008. CEUR Workshop Proceedings, vol. 410. CEUR-WS.org (2008). http:\/\/ceur-ws.org\/Vol-410\/Paper01.pdf"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-319-49493-7_5","volume-title":"Reasoning Web: Logical Foundation of Knowledge Graph Construction and Query Answering","author":"M Bienvenu","year":"2017","unstructured":"Bienvenu, M., Bourgaux, C.: Inconsistency-tolerant querying of description logic knowledge bases. In: Pan, J.Z., et al. (eds.) Reasoning Web 2016. LNCS, vol. 9885, pp. 156\u2013202. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-49493-7_5"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Henzinger, M.R., Henzinger, T.A., Kopke, P.W.: Computing simulations on finite and infinite graphs. In: 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, USA, 23\u201325 October 1995, pp. 453\u2013462. IEEE Computer Society (1995). https:\/\/doi.org\/10.1109\/SFCS.1995.492576","DOI":"10.1109\/SFCS.1995.492576"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/978-3-540-76298-0_20","volume-title":"The Semantic Web","author":"A Kalyanpur","year":"2007","unstructured":"Kalyanpur, A., Parsia, B., Horridge, M., Sirin, E.: Finding all justifications of OWL DL entailments. In: Aberer, K., et al. (eds.) ASWC\/ISWC -2007. LNCS, vol. 4825, pp. 267\u2013280. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-76298-0_20"},{"key":"8_CR12","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.websem.2015.04.002","volume":"33","author":"D Lembo","year":"2015","unstructured":"Lembo, D., Lenzerini, M., Rosati, R., Ruzzi, M., Savo, D.F.: Inconsistency-tolerant query answering in ontology-based data access. J. Web Semant. 33, 3\u201329 (2015). https:\/\/doi.org\/10.1016\/j.websem.2015.04.002","journal-title":"J. Web Semant."},{"issue":"2","key":"8_CR13","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/j.jsc.2008.10.007","volume":"45","author":"C Lutz","year":"2010","unstructured":"Lutz, C., Wolter, F.: Deciding inseparability and conservative extensions in the description logic $$\\cal{EL}$$. J. Symb. Comput. 45(2), 194\u2013228 (2010). https:\/\/doi.org\/10.1016\/j.jsc.2008.10.007","journal-title":"J. Symb. Comput."},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/978-3-030-22102-7_18","volume-title":"Description Logic, Theory Combination, and All That","author":"VB Matos","year":"2019","unstructured":"Matos, V.B., Guimar\u00e3es, R., Santos, Y.D., Wassermann, R.: Pseudo-contractions as gentle repairs. In: Lutz, C., Sattler, U., Tinelli, C., Turhan, A.-Y., Wolter, F. (eds.) Description Logic, Theory Combination, and All That. LNCS, vol. 11560, pp. 385\u2013403. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-22102-7_18"},{"key":"8_CR15","unstructured":"Meyer, T.A., Lee, K., Booth, R., Pan, J.Z.: Finding maximally satisfiable terminologies for the description logic $$\\cal{{ALC}}$$. In: Proceedings, The Twenty-First National Conference on Artificial Intelligence and the Eighteenth Innovative Applications of Artificial Intelligence Conference, 16\u201320 July 2006, Boston, Massachusetts, USA, pp. 269\u2013274. AAAI Press (2006). http:\/\/www.aaai.org\/Library\/AAAI\/2006\/aaai06-043.php"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Parsia, B., Sirin, E., Kalyanpur, A.: Debugging OWL ontologies. In: Proceedings of the 14th International Conference on World Wide Web, WWW 2005, Chiba, Japan, 10\u201314 May 2005. pp. 633\u2013640. ACM (2005). https:\/\/doi.org\/10.1145\/1060745.1060837","DOI":"10.1145\/1060745.1060837"},{"key":"8_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/978-3-642-21034-1_28","volume-title":"The Semantic Web: Research and Applications","author":"R Pe\u00f1aloza","year":"2011","unstructured":"Pe\u00f1aloza, R., Turhan, A.-Y.: A practical approach for computing generalization inferences in $$\\cal{EL}$$. In: Antoniou, G., et al. (eds.) ESWC 2011, Part I. LNCS, vol. 6643, pp. 410\u2013423. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21034-1_28"},{"key":"8_CR18","unstructured":"Schlobach, S., Cornet, R.: Non-standard reasoning services for the debugging of description logic terminologies. In: IJCAI-03, Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, Acapulco, Mexico, 9\u201315 August 2003, pp. 355\u2013362. Morgan Kaufmann (2003). http:\/\/ijcai.org\/Proceedings\/03\/Papers\/053.pdf"},{"issue":"3","key":"8_CR19","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/s10817-007-9076-z","volume":"39","author":"S Schlobach","year":"2007","unstructured":"Schlobach, S., Huang, Z., Cornet, R., van Harmelen, F.: Debugging incoherent terminologies. J. Autom. Reason. 39(3), 317\u2013349 (2007). https:\/\/doi.org\/10.1007\/s10817-007-9076-z","journal-title":"J. Autom. Reason."},{"key":"8_CR20","unstructured":"Zarrie\u00df, B., Turhan, A.: Most specific generalizations w.r.t. general $$\\cal{EL}$$-TBoxes. In: IJCAI 2013, Proceedings of the 23rd International Joint Conference on Artificial Intelligence, Beijing, China, 3\u20139 August 2013, pp. 1191\u20131197. IJCAI\/AAAI (2013). http:\/\/www.aaai.org\/ocs\/index.php\/IJCAI\/IJCAI13\/paper\/view\/6709"}],"container-title":["Lecture Notes in Computer Science","The Semantic Web"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-06981-9_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T16:16:08Z","timestamp":1710260168000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-06981-9_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031069802","9783031069819"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-06981-9_8","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":"31 May 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ESWC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Semantic Web Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hersonissos","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","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":"29 May 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 June 2022","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":"esws2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2022.eswc-conferences.org\/","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":"66","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":"46","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":"36","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":"70% - 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":"1.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)"}}]}}