{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T22:24:07Z","timestamp":1775082247247,"version":"3.50.1"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030798758","type":"print"},{"value":"9783030798765","type":"electronic"}],"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:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,7,5]],"date-time":"2021-07-05T00:00:00Z","timestamp":1625443200000},"content-version":"vor","delay-in-days":185,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The application of automated reasoning approaches to Description Logic (DL) ontologies may produce certain consequences that either are deemed to be wrong or should be hidden for privacy reasons. The question is then how to repair the ontology such that the unwanted consequences can no longer be deduced. An optimal repair is one where the least amount of other consequences is removed. Most of the previous approaches to ontology repair are of a syntactic nature in that they remove or weaken the axioms explicitly present in the ontology, and thus cannot achieve semantic optimality. In previous work, we have addressed the problem of computing optimal repairs of (quantified) ABoxes, where the unwanted consequences are described by concept assertions of the lightweight DL\u00a0<jats:inline-formula><jats:alternatives><jats:tex-math>$$\\mathcal {EL}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mi>EL<\/mml:mi><\/mml:math><\/jats:alternatives><\/jats:inline-formula>. In the present paper, we improve on the results achieved so far in two ways. First, we allow for the presence of terminological knowledge in the form of an<jats:inline-formula><jats:alternatives><jats:tex-math>$$\\mathcal {EL}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mi>EL<\/mml:mi><\/mml:math><\/jats:alternatives><\/jats:inline-formula>TBox. This TBox is assumed to be static in the sense that it cannot be changed in the repair process. Second, the construction of optimal repairs described in our previous work is best case exponential. We introduce an optimized construction that is exponential only in the worst case. First experimental results indicate that this reduces the size of the computed optimal repairs considerably.<\/jats:p>","DOI":"10.1007\/978-3-030-79876-5_18","type":"book-chapter","created":{"date-parts":[[2021,7,7]],"date-time":"2021-07-07T09:20:19Z","timestamp":1625649619000},"page":"309-326","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Computing Optimal Repairs of Quantified\u00a0ABoxes w.r.t. Static $$\\mathcal {EL}$$ TBoxes"],"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":[[2021,7,5]]},"reference":[{"key":"18_CR1","unstructured":"Baader, F., Borgwardt, S., Morawska, B.: Extending unification in $$\\cal{EL}$$ towards general TBoxes. In: Proc. of the 13th Int. Conf. on Principles of Knowledge Representation and Reasoning (KR 2012). pp. 568\u2013572. AAAI Press\/The MIT Press (2012)"},{"key":"18_CR2","unstructured":"Baader, F., Brandt, S., Lutz, C.: Pushing the $$\\cal{EL}$$ envelope. In: Kaelbling, L.P., Saffiotti, A. (eds.) IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30 - August 5, 2005. pp. 364\u2013369. Professional Book Center (2005)"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Baader, F., Horrocks, I., Lutz, C., Sattler, U.: An Introduction to Description Logic. Cambridge University Press (2017)","DOI":"10.1017\/9781139025355"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Baader, F., Koopmann, P., Kriegel, F., Nuradiansyah, A.: Computing optimal repairs of quantified ABoxes w.r.t. static $$\\cal{EL}$$ TBoxes (extended version). LTCS-Report 21-01, Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universit\u00e4t Dresden, Dresden, Germany (2021), https:\/\/lat.inf.tu-dresden.de\/research\/reports\/2021\/BaKoKrNu-LTCS-21-01.pdf","DOI":"10.25368\/2022.64"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Baader, F., Kriegel, F., Nuradiansyah, A.: Privacy-preserving ontology publishing for $$\\cal{EL}$$ instance stores. In: Calimeri, F., Leone, N., Manna, M. (eds.) Logics in Artificial Intelligence - 16th European Conference, JELIA 2019, Rende, Italy, May 7\u201311, 2019, Proceedings. Lecture Notes in Computer Science, vol. 11468, pp. 323\u2013338. Springer (2019)","DOI":"10.1007\/978-3-030-19570-0_21"},{"key":"18_CR6","unstructured":"Baader, F., Kriegel, F., Nuradiansyah, A., Pe\u00f1aloza, R.: Making repairs in description logics more gentle. In: Thielscher, M., Toni, F., Wolter, F. (eds.) Principles of Knowledge Representation and Reasoning: Proceedings of the Sixteenth International Conference, KR 2018, Tempe, Arizona, 30 October - 2 November 2018. pp. 319\u2013328. AAAI Press (2018)"},{"key":"18_CR7","doi-asserted-by":"crossref","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., Tamma, V.A.M., d\u2019Amato, C., Janowicz, K., Fu, B., Polleres, A., Seneviratne, O., Kagal, L. (eds.) The Semantic Web - ISWC 2020 - 19th International Semantic Web Conference, Athens, Greece, November 2\u20136, 2020, Proceedings, Part I. Lecture Notes in Computer Science, vol. 12506, pp. 3\u201320. Springer (2020)","DOI":"10.1007\/978-3-030-62419-4_1"},{"key":"18_CR8","unstructured":"Baader, F., Suntisrivaraporn, B.: Debugging SNOMED CT using axiom pinpointing in the description logic $$\\cal{EL}^+$$. In: Proceedings of the International Conference on Representing and Sharing Knowledge Using SNOMED (KR-MED\u201908). Phoenix, Arizona (2008)"},{"key":"18_CR9","unstructured":"Boyle, T.C.: Talk to Me. Bloomsbury Publishing (2021), To appear"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Cal\u00ec, A., Lembo, D., Rosati, R.: On the decidability and complexity of query answering over inconsistent and incomplete databases. In: Neven, F., Beeri, C., Milo, T. (eds.) Proceedings of the Twenty-Second ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 9\u201312, 2003, San Diego, CA, USA. pp. 260\u2013271. ACM (2003)","DOI":"10.1145\/773153.773179"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Carral, D., Dragoste, I., Gonz\u00e1lez, L., Jacobs, C.J.H., Kr\u00f6tzsch, M., Urbani, J.: Vlog: A rule engine for knowledge graphs. In: Ghidini, C., Hartig, O., Maleshkova, M., Sv\u00e1tek, V., Cruz, I.F., Hogan, A., Song, J., Lefran\u00e7ois, M., Gandon, F. (eds.) The Semantic Web - ISWC 2019\u201318th International Semantic Web Conference. Lecture Notes in Computer Science, vol. 11779, pp. 19\u201335. Springer (2019)","DOI":"10.1007\/978-3-030-30796-7_2"},{"issue":"3","key":"18_CR12","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s10817-014-9305-1","volume":"53","author":"B Glimm","year":"2014","unstructured":"Glimm, B., Horrocks, I., Motik, B., Stoilos, G., Wang, Z.: Hermit: An OWL 2 reasoner. J. Autom. Reason. 53(3), 245\u2013269 (2014)","journal-title":"J. Autom. Reason."},{"key":"18_CR13","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1613\/jair.3949","volume":"47","author":"BC Grau","year":"2013","unstructured":"Grau, B.C., Horrocks, I., Kr\u00f6tzsch, M., Kupke, C., Magka, D., Motik, B., Wang, Z.: Acyclicity notions for existential rules and their application to query answering in ontologies. J. Artif. Intell. Res. 47, 741\u2013808 (2013)","journal-title":"J. Artif. Intell. Res."},{"key":"18_CR14","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1613\/jair.1.11355","volume":"64","author":"BC Grau","year":"2019","unstructured":"Grau, B.C., Kostylev, E.V.: Logical foundations of linked data anonymisation. J. Artif. Intell. Res. 64, 253\u2013314 (2019)","journal-title":"J. Artif. Intell. Res."},{"issue":"3","key":"18_CR15","doi-asserted-by":"publisher","first-page":"267","DOI":"10.3233\/SW-2011-0032","volume":"3","author":"V Haarslev","year":"2012","unstructured":"Haarslev, V., Hidde, K., M\u00f6ller, R., Wessel, M.: The RacerPro knowledge representation and reasoning system. Semantic Web 3(3), 267\u2013277 (2012)","journal-title":"Semantic Web"},{"key":"18_CR16","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)"},{"issue":"6","key":"18_CR17","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1093\/bib\/bbv011","volume":"16","author":"R Hoehndorf","year":"2015","unstructured":"Hoehndorf, R., Schofield, P.N., Gkoutos, G.V.: The role of ontologies in biological and biomedical research: A functional perspective. Brief. Bioinform. 16(6), 1069\u20131080 (2015)","journal-title":"Brief. Bioinform."},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"Horridge, M., Parsia, B., Sattler, U.: Laconic and precise justifications in OWL. In: Sheth, A.P., Staab, S., Dean, M., Paolucci, M., Maynard, D., Finin, T.W., Thirunarayan, K. (eds.) The Semantic Web - ISWC 2008, 7th International Semantic Web Conference, ISWC 2008, Karlsruhe, Germany, October 26\u201330, 2008. Proceedings. Lecture Notes in Computer Science, vol. 5318, pp. 323\u2013338. Springer (2008)","DOI":"10.1007\/978-3-540-88564-1_21"},{"key":"18_CR19","unstructured":"Horrocks, I., Li, L., Turi, D., Bechhofer, S.: The instance store: DL reasoning with large numbers of individuals. In: Haarslev, V., M\u00f6ller, R. (eds.) Proceedings of the 2004 International Workshop on Description Logics (DL2004), Whistler, British Columbia, Canada, June 6\u20138, 2004. CEUR Workshop Proceedings, vol. 104. CEUR-WS.org (2004)"},{"key":"18_CR20","doi-asserted-by":"crossref","unstructured":"Johnson, D.S., Klug, A.C.: Testing containment of conjunctive queries under functional and inclusion dependencies. In: Ullman, J.D., Aho, A.V. (eds.) Proceedings of the ACM Symposium on Principles of Database Systems, March 29\u201331, 1982, Los Angeles, California, USA. pp. 164\u2013169. ACM (1982)","DOI":"10.1145\/588111.588138"},{"key":"18_CR21","doi-asserted-by":"crossref","unstructured":"Kalyanpur, A., Parsia, B., Horridge, M., Sirin, E.: Finding all justifications of OWL DL entailments. In: Proc. of ISWC\u201907. Lecture Notes in Computer Science, vol. 4825, pp. 267\u2013280. Springer-Verlag (2007)","DOI":"10.1007\/978-3-540-76298-0_20"},{"key":"18_CR22","doi-asserted-by":"crossref","unstructured":"Kazakov, Y., Kr\u00f6tzsch, M., Simancik, F.: The incredible ELK - from polynomial procedures to efficient reasoning with $$\\cal{EL}$$ ontologies. Journal of Automed Reasoning 53(1), 1\u201361 (2014)","DOI":"10.1007\/s10817-013-9296-3"},{"key":"18_CR23","doi-asserted-by":"crossref","unstructured":"K\u00fcsters, R.: Non-standard Inferences in Description Logics. Lecture Notes in Artificial Intelligence, vol. 2100. Springer-Verlag (2001)","DOI":"10.1007\/3-540-44613-3"},{"key":"18_CR24","first-page":"62","volume":"10","author":"JSC Lam","year":"2008","unstructured":"Lam, J.S.C., Sleeman, D.H., Pan, J.Z., Vasconcelos, W.W.: A fine-grained approach to resolving unsatisfiable ontologies. J. Data Semant. 10, 62\u201395 (2008)","journal-title":"J. Data Semant."},{"key":"18_CR25","unstructured":"Lutz, C., Wolter, F.: Deciding inseparability and conservative extensions in the description logic $$\\cal{EL}$$. J. Symb. Comput. 45(2), 194\u2013228 (2010)"},{"issue":"4","key":"18_CR26","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1145\/320107.320115","volume":"4","author":"D Maier","year":"1979","unstructured":"Maier, D., Mendelzon, A.O., Sagiv, Y.: Testing implications of data dependencies. ACM Trans. Database Syst. 4(4), 455\u2013469 (1979)","journal-title":"ACM Trans. Database Syst."},{"key":"18_CR27","unstructured":"Meyer, T., Lee, K., Booth, R., Pan, J.Z.: Finding maximally satisfiable terminologies for the description logic $$\\cal{{ALC}}$$. In: Proc. of the 21st Nat. Conf. on Artificial Intelligence (AAAI 2006). AAAI Press\/The MIT Press (2006)"},{"issue":"4","key":"18_CR28","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/s10817-017-9406-8","volume":"59","author":"B Parsia","year":"2017","unstructured":"Parsia, B., Matentzoglu, N., Gon\u00e7alves, R.S., Glimm, B., Steigmiller, A.: The OWL Reasoner Evaluation (ORE) 2015 competition report. Journal of Automed Reasoning 59(4), 455\u2013482 (2017)","journal-title":"Journal of Automed Reasoning"},{"key":"18_CR29","doi-asserted-by":"crossref","unstructured":"Parsia, B., Sirin, E., Kalyanpur, A.: Debugging OWL ontologies. In: Ellis, A., Hagino, T. (eds.) Proc. of the 14th International Conference on World Wide Web (WWW\u201905). pp. 633\u2013640. ACM (2005)","DOI":"10.1145\/1060745.1060837"},{"key":"18_CR30","unstructured":"Rosati, R.: On conjunctive query answering in $$\\cal{EL}$$. In: Calvanese, D., Franconi, E., Haarslev, V., Lembo, D., Motik, B., Turhan, A., Tessaris, S. (eds.) Proceedings of the 2007 International Workshop on Description Logics (DL2007), Brixen-Bressanone, near Bozen-Bolzano, Italy, 8\u201310 June, 2007. CEUR Workshop Proceedings, vol. 250. CEUR-WS.org (2007)"},{"key":"18_CR31","unstructured":"Schlobach, S., Cornet, R.: Non-standard reasoning services for the debugging of description logic terminologies. In: Gottlob, G., Walsh, T. (eds.) Proc. of the 18th Int. Joint Conf. on Artificial Intelligence (IJCAI 2003). pp. 355\u2013362. Morgan Kaufmann, Los Altos, Acapulco, Mexico (2003)"},{"issue":"3","key":"18_CR32","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., Harmelen, F.: Debugging incoherent terminologies. J. Automated Reasoning 39(3), 317\u2013349 (2007)","journal-title":"Debugging incoherent terminologies. J. Automated Reasoning"},{"key":"18_CR33","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.websem.2014.06.003","volume":"27\u201328","author":"A Steigmiller","year":"2014","unstructured":"Steigmiller, A., Liebig, T., Glimm, B.: Konclude: System description. J. Web Semant. 27\u201328, 78\u201385 (2014)","journal-title":"J. Web Semant."},{"key":"18_CR34","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-18), the 30th innovative Applications of Artificial Intelligence (IAAI-18), and the 8th AAAI Symposium on Educational Advances in Artificial Intelligence (EAAI-18), New Orleans, Louisiana, USA, February 2\u20137, 2018. pp. 1981\u20131988. AAAI Press (2018)"}],"container-title":["Lecture Notes in Computer Science","Automated Deduction \u2013 CADE 28"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-79876-5_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T15:30:53Z","timestamp":1725377453000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-79876-5_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030798758","9783030798765"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-79876-5_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"5 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CADE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Automated Deduction","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":"12 July 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cade2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cs.cmu.edu\/~mheule\/CADE28\/","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":"76","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":"29","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":"38% - 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":"5","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)"}},{"value":"2 invited papers and 7 system descriptions are also included.","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)"}}]}}