skip to main content
10.1145/3555776.3577630acmconferencesArticle/Chapter ViewAbstractPublication PagessacConference Proceedingsconference-collections
research-article

Treating Role Assertions as First-class Citizens in Repair and Error-tolerant Reasoning

Published:07 June 2023Publication History

ABSTRACT

Errors in Description Logic (DL) ontologies are often detected when reasoning yields unintuitive consequences. The question is then how to repair the ontology in an optimal way, i.e., such that the unwanted consequences are removed, but a maximal set of the unobjected consequences is kept. Error-tolerant reasoning does not commit to a single optimal repair: brave reasoning asks whether the consequence is entailed by some repair and cautious reasoning whether it is entailed by all repairs. Previous research on repairing ABoxes w.r.t. TBoxes formulated in the DL EL has developed methods for computing optimal repairs, and has recently also determined the complexity of error-tolerant reasoning: brave reasoning is in P and cautious reasoning is in coNP. However, in this work the unwanted consequences were restricted to being EL instance assertions. In the present paper, we show that the mentioned results can be extended to a setting where also role assertions can be required to be removed. Our solution is based on a two-stage approach where first the unwanted role assertions and then the unwanted concept assertions are removed. We also investigate the complexity of error-tolerant reasoning w.r.t. classical repairs, which are maximal subsets of the ABox that do not have the unwanted consequences, and show that, in this setting, brave reasoning is NP-complete and cautious reasoning is coNP-complete.

References

  1. Franz Baader, Sebastian Brandt, and Carsten Lutz. 2005. Pushing the EL Envelope. In IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30 - August 5, 2005, Leslie Pack Kaelbling and Alessandro Saffiotti (Eds.). Professional Book Center, 364--369. http://ijcai.org/Proceedings/05/Papers/0372.pdfGoogle ScholarGoogle Scholar
  2. Franz Baader, Ian Horrocks, Carsten Lutz, and Ulrike Sattler. 2017. An Introduction to Description Logic. Cambridge University Press. Google ScholarGoogle ScholarCross RefCross Ref
  3. Franz Baader, Patrick Koopmann, Francesco Kriegel, and Adrian Nuradiansyah. 2021. Computing Optimal Repairs of Quantified ABoxes w.r.t. Static EL TBoxes. In Automated Deduction - CADE 28 - 28th International Conference on Automated Deduction, Virtual Event, July 12-15, 2021, Proceedings (Lecture Notes in Computer Science), André Platzer and Geoff Sutcliffe (Eds.), Vol. 12699. Springer, 309--326. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Franz Baader, Patrick Koopmann, Francesco Kriegel, and Adrian Nuradiansyah. 2022. Optimal ABox Repair w.r.t. Static EL TBoxes: From Quantified ABoxes Back to ABoxes. In The Semantic Web - 19th International Conference, ESWC 2022, Proceedings (Lecture Notes in Computer Science), Paul Groth, Maria-Esther Vidal, Fabian M. Suchanek, Pedro A. Szekely, Pavan Kapanipathi, Catia Pesquita, Hala Skaf-Molli, and Minna Tamper (Eds.), Vol. 13261. Springer, 130--146. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Franz Baader, Patrick Koopmann, Francesco Kriegel, and Adrian Nuradiansyah. 2022. Optimal ABox Repair w.r.t. Static 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ät Dresden, Dresden, Germany. Google ScholarGoogle ScholarCross RefCross Ref
  6. Franz Baader and Francesco Kriegel. 2022. Pushing Optimal ABox Repair from EL Towards More Expressive Horn-DLs. In Proceedings of the 19th International Conference on Principles of Knowledge Representation and Reasoning, KR 2022, Haifa, Israel. July 31 - August 5, 2022, Gabriele Kern-Isberner, Gerhard Lakemeyer, and Thomas Meyer (Eds.). Google ScholarGoogle ScholarCross RefCross Ref
  7. Franz Baader, Francesco Kriegel, and Adrian Nuradiansyah. 2019. Privacy-Preserving Ontology Publishing for EL Instance Stores. In Logics in Artificial Intelligence - 16th European Conference, JELIA 2019, Rende, Italy, May 7-11, 2019, Proceedings (Lecture Notes in Computer Science), Francesco Calimeri, Nicola Leone, and Marco Manna (Eds.), Vol. 11468. Springer, 323--338. Google ScholarGoogle ScholarCross RefCross Ref
  8. Franz Baader, Francesco Kriegel, and Adrian Nuradiansyah. 2022. Error-Tolerant Reasoning in the Description Logic EL Based On Optimal Repairs. In Rules and Reasoning - 6th International Joint Conference, RuleML+RR 2022, Virtual, September 26-28, 2022, Proceedings, Guido Governatori and Anni-Yasmin Turhan (Eds.). Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Franz Baader, Francesco Kriegel, Adrian Nuradiansyah, and Rafael Peñaloza. 2020. Computing Compliant Anonymisations of Quantified ABoxes w.r.t. EL Policies. In The Semantic Web - ISWC 2020 - 19th International Semantic Web Conference, Athens, Greece, November 2-6, 2020, Proceedings, Part I (Lecture Notes in Computer Science), Jeff Z. Pan, Valentina A. M. Tamma, Claudia d'Amato, Krzysztof Janowicz, Bo Fu, Axel Polleres, Oshani Seneviratne, and Lalana Kagal (Eds.), Vol. 12506. Springer, 3--20. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Franz Baader and Barbara Morawska. 2010. Unification in the Description Logic EL. Log. Methods Comput. Sci. 6, 3 (2010). http://arxiv.org/abs/1006.2289Google ScholarGoogle Scholar
  11. Steven Fortune, John E. Hopcroft, and James Wyllie. 1980. The Directed Subgraph Homeomorphism Problem. Theor. Comput. Sci. 10 (1980), 111--121. Google ScholarGoogle ScholarCross RefCross Ref
  12. Russell Greiner, Barbara A. Smith, and Ralph W. Wilkerson. 1989. A Correction to the Algorithm in Reiter's Theory of Diagnosis. Artif. Intell. 41, 1 (1989), 79--88. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Monika Rauch Henzinger, Thomas A. Henzinger, and Peter W. Kopke. 1995. Computing Simulations on Finite and Infinite Graphs. In 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, USA, 23-25 October 1995. IEEE Computer Society, 453--462. Google ScholarGoogle ScholarCross RefCross Ref
  14. Aditya Kalyanpur, Bijan Parsia, Evren Sirin, and Bernardo Cuenca Grau. 2006. Repairing Unsatisfiable Concepts in OWL Ontologies. In The Semantic Web: Research and Applications, 3rd European Semantic Web Conference, ESWC 2006, Budva, Montenegro, June 11-14, 2006, Proceedings (Lecture Notes in Computer Science), York Sure and John Domingue (Eds.), Vol. 4011. Springer, 170--184. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Andrea S. LaPaugh and Christos H. Papadimitriou. 1984. The even-path problem for graphs and digraphs. Networks 14, 4 (1984), 507--513. Google ScholarGoogle ScholarCross RefCross Ref
  16. Michel Ludwig and Rafael Peñaloza. 2014. Error-Tolerant Reasoning in the Description Logic EL. In Logics in Artificial Intelligence - 14th European Conference, JELIA 2014, Funchal, Madeira, Portugal, September 24-26, 2014. Proceedings (Lecture Notes in Computer Science), Eduardo Fermé and João Leite (Eds.), Vol. 8761. Springer, 107--121. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Rafael Peñaloza. 2020. Error-Tolerance and Error Management in Lightweight Description Logics. Künstliche Intell. 34, 4 (2020), 491--500. Google ScholarGoogle ScholarCross RefCross Ref
  18. Raymond Reiter. 1987. A Theory of Diagnosis from First Principles. Artif. Intell. 32, 1 (1987), 57--95. (See the erratum [12]). Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Thomas J. Schaefer. 1978. The Complexity of Satisfiability Problems. In Proceedings of the 10th Annual ACM Symposium on Theory of Computing, May 1--3, 1978, San Diego, California, USA, Richard J. Lipton, Walter A. Burkhard, Walter J. Savitch, Emily P. Friedman, and Alfred V. Aho (Eds.). ACM, 216--226. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Stefan Schlobach. 2005. Debugging and Semantic Clarification by Pinpointing. In The Semantic Web: Research and Applications, Second European Semantic Web Conference, ESWC 2005, Heraklion, Crete, Greece, May 29 - June 1, 2005, Proceedings (Lecture Notes in Computer Science), Asunción Gómez-Pérez and Jérôme Euzenat (Eds.), Vol. 3532. Springer, 226--240. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Stefan Schlobach. 2005. Diagnosing Terminologies. In Proceedings, The Twentieth National Conference on Artificial Intelligence and the Seventeenth Innovative Applications of Artificial Intelligence Conference, July 9-13, 2005, Pittsburgh, Pennsylvania, USA, Manuela M. Veloso and Subbarao Kambhampati (Eds.). AAAI Press/ The MIT Press, 670--675. http://www.aaai.org/Library/AAAI/2005/aaai05-105.phpGoogle ScholarGoogle Scholar

Index Terms

  1. Treating Role Assertions as First-class Citizens in Repair and Error-tolerant Reasoning

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in
        • Published in

          cover image ACM Conferences
          SAC '23: Proceedings of the 38th ACM/SIGAPP Symposium on Applied Computing
          March 2023
          1932 pages
          ISBN:9781450395175
          DOI:10.1145/3555776

          Copyright © 2023 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 7 June 2023

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • research-article

          Acceptance Rates

          Overall Acceptance Rate1,650of6,669submissions,25%

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader