{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T18:45:01Z","timestamp":1747248301317,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031215407"},{"type":"electronic","value":"9783031215414"}],"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-21541-4_15","type":"book-chapter","created":{"date-parts":[[2022,12,13]],"date-time":"2022-12-13T06:02:41Z","timestamp":1670911361000},"page":"227-243","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Error-Tolerant Reasoning in\u00a0the\u00a0Description Logic $$\\mathcal{E}\\mathcal{L}$$ Based on\u00a0Optimal Repairs"],"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-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,12,14]]},"reference":[{"key":"15_CR1","unstructured":"Baader, F., Brandt, S., Lutz, C.: Pushing the $$\\cal{EL} $$ envelope. In: IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence. Professional Book Center (2005). https:\/\/www.ijcai.org\/Proceedings\/05\/Papers\/0372.pdf"},{"key":"15_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)"},{"key":"15_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\u00a0ABoxes 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":"15_CR4","doi-asserted-by":"publisher","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:\/\/doi.org\/10.25368\/2022.64","DOI":"10.25368\/2022.64"},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/978-3-031-06981-9_8","volume-title":"The Semantic Web","author":"F Baader","year":"2022","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. In: Groth, P., et al. (eds.) ESWC 2022. LNCS, vol. 13261, pp. 130\u2013146. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-06981-9_8"},{"key":"15_CR6","doi-asserted-by":"publisher","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-01, 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":"15_CR7","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":"15_CR8","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":"15_CR9","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 2008), Phoenix, Arizona (2008). http:\/\/ceur-ws.org\/Vol-410\/Paper01.pdf"},{"key":"15_CR10","unstructured":"Bienvenu, M., Rosati, R.: Tractable approximations of consistent query answering for robust ontology-based data access. In: IJCAI 2013, Proceedings of the 23rd International Joint Conference on Artificial Intelligence. IJCAI\/AAAI (2013). https:\/\/www.ijcai.org\/Proceedings\/13\/Papers\/121.pdf"},{"key":"15_CR11","doi-asserted-by":"publisher","unstructured":"Cal\u00ec, A., Lembo, D., Rosati, R.: On the decidability and complexity of query answering over inconsistent and incomplete databases. In: Proceedings of the Twenty-Second ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. ACM (2003). https:\/\/doi.org\/10.1145\/773153.773179","DOI":"10.1145\/773153.773179"},{"key":"15_CR12","doi-asserted-by":"publisher","unstructured":"Cima, G., Lembo, D., Rosati, R., Savo, D.F.: Controlled query evaluation in description logics through instance indistinguishability. In: Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI 2020. ijcai.org (2020). https:\/\/doi.org\/10.24963\/ijcai.2020\/248","DOI":"10.24963\/ijcai.2020\/248"},{"key":"15_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-031-15791-2_11","volume-title":"Artificial Intelligence","author":"F Kriegel","year":"2022","unstructured":"Kriegel, F.: Optimal fixed-premise repairs of $$\\cal{EL} $$ TBoxes. In: Bergmann, R., Malburg, L., Rodermund, S.C., Timm, I.J. (eds.) KI 2022. LNCS, vol. 13404, pp. 115\u2013130. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15791-2_11"},{"key":"15_CR14","doi-asserted-by":"publisher","unstructured":"Kriegel, F.: Optimal fixed-premise repairs of $$\\cal{EL} $$ TBoxes (extended version). LTCS-Report 22-04, Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universit\u00e4t Dresden, Dresden, Germany (2022). https:\/\/doi.org\/10.25368\/2022.321","DOI":"10.25368\/2022.321"},{"key":"15_CR15","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."},{"key":"15_CR16","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-319-11558-0_8","volume-title":"Logics in Artificial Intelligence","author":"M Ludwig","year":"2014","unstructured":"Ludwig, M., Pe\u00f1aloza, R.: Error-tolerant reasoning in the description logic $$\\cal{E{}L}$$. In: Ferm\u00e9, E., Leite, J. (eds.) JELIA 2014. LNCS (LNAI), vol. 8761, pp. 107\u2013121. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11558-0_8"},{"key":"15_CR17","doi-asserted-by":"publisher","unstructured":"Parsia, B., Sirin, E., Kalyanpur, A.: Debugging OWL ontologies. In: Proceedings of the 14th International Conference on World Wide Web (WWW 2005). ACM (2005). https:\/\/doi.org\/10.1145\/1060745.1060837","DOI":"10.1145\/1060745.1060837"},{"issue":"4","key":"15_CR18","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/s13218-020-00684-5","volume":"34","author":"R Pe\u00f1aloza","year":"2020","unstructured":"Pe\u00f1aloza, R.: Error-tolerance and error management in lightweight description logics. K\u00fcnstliche Intell. 34(4), 491\u2013500 (2020). https:\/\/doi.org\/10.1007\/s13218-020-00684-5","journal-title":"K\u00fcnstliche Intell."},{"issue":"3","key":"15_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., 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."}],"container-title":["Lecture Notes in Computer Science","Rules and Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-21541-4_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,13]],"date-time":"2022-12-13T06:04:20Z","timestamp":1670911460000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-21541-4_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031215407","9783031215414"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-21541-4_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"14 December 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RuleML+RR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Joint Conference on Rules and Reasoning","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rulemlrr2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dblp.org\/db\/conf\/rulemlrr\/index.html","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.org","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"54","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":"18","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":"33% - 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.2","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":"2.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)"}}]}}