skip to main content
10.1145/3583780.3614771acmconferencesArticle/Chapter ViewAbstractPublication PagescikmConference Proceedingsconference-collections
research-article

Highly-Optimized Forgetting for Creating Signature-Based Views of Ontologies

Published: 21 October 2023 Publication History

Abstract

Uniform interpolation (UI) is a non-standard reasoning service that seeks to project an ontology down to its sub-signature --- given an ontology taking a certain signature, and a subset Σ of "relevant names'' of that signature, compute a new ontology, called a uniform interpolant, that uses only the relevant names while preserving the semantics of the relevant names in the uniform interpolant. UI is of great potential importance since it may be used in a variety of applications where suitable views of ontologies need to be computed. However, this potential can only be fully realized if a highly optimized method for computing such views exists. Previous research has shown that computing uniform interpolants of ELH-ontologies is a computationally extremely hard problem --- a finite uniform interpolant does not always exist for ELH, and if it exists, then there exists one of at most triple exponential size in terms of the original ontology, and that, in the worst case, no shorter interpolant exists. Despite the inherent difficulty of the problem, in this paper, we present a highly optimized forgetting method for computing uniform interpolants of ELH-ontologies, and show however that, with good reduction and inference strategies, such uniform interpolants can be efficiently computed. The method is an improvement of the one presented in our previous work. What sets it apart is its flexibility to treat concept names of different types differently, effectively cutting down on the inferences involved. This treatment is primarily driven by the polarities of the concept names within an ontology. A comprehensive evaluation with a prototypical implementation of the method shows >95% average success rates over two popular benchmark datasets and demonstrates a clear computational advantage over state-of-the-art systems.

References

[1]
Grigoris Antoniou and Frank van Harmelen. 2004. Web Ontology Language: OWL. Springer Berlin Heidelberg, 67--92.
[2]
Franz Baader, Sebastian Brandt, and Carsten Lutz. 2005. Pushing the EL Envelope. In Proc. IJCAI'05. Professional Book Center, 364--369.
[3]
Franz Baader, Ian Horrocks, Carsten Lutz, and Ulrike Sattler. 2017. An Introduction to Description Logic. Cambridge University Press.
[4]
Elena Botoeva, Boris Konev, Carsten Lutz, Vladislav Ryzhikov, Frank Wolter, and Michael Zakharyaschev. 2016. Inseparability and Conservative Extensions of Description Logic Ontologies: A Survey. In Proc. RW'16 (Lecture Notes in Computer Science, Vol. 9885). Springer, 27--89.
[5]
Diego Calvanese, Giuseppe De Giacomo, and Maurizio Lenzerini. 1999. Reasoning in Expressive Description Logics with Fixpoints based on Automata on Infinite Trees. In Proc. IJCAI'99. Morgan Kaufmann, 84--89.
[6]
Jieying Chen, Ghadah Alghamdi, Renate A. Schmidt, Dirk Walther, and Yongsheng Gao. 2019. Ontology Extraction for Large Ontologies via Modularity and Forgetting. In K-CAP'19. ACM, 45--52.
[7]
Warren Del-Pinto and Renate A. Schmidt. 2019. ABox Abduction via Forgetting in $mathcalALC$. In Proc. AAAI'19. AAAI Press, 2768--2775.
[8]
Paul Doran, Valentina A. M. Tamma, and Luigi Iannone. 2007. Ontology module extraction for ontology reuse: an ontology engineering perspective. In Proc. CIKM'07. ACM, 61--70.
[9]
Silvio Ghilardi, Carsten Lutz, and Frank Wolter. 2006. Did I Damage My Ontology? A Case for Conservative Extensions in Description Logics. In Proc. KR'06. AAAI Press, 187--197.
[10]
Bernardo Cuenca Grau, Ian Horrocks, Yevgeny Kazakov, and Ulrike Sattler. 2007. Just the right amount: extracting modules from ontologies. In Proc. WWW'07. ACM, 717--726.
[11]
Bernardo Cuenca Grau, Ian Horrocks, Yevgeny Kazakov, and Ulrike Sattler. 2008. Modular Reuse of Ontologies: Theory and Practice. J. Artif. Intell. Res., Vol. 31 (2008), 273--318.
[12]
Bernardo Cuenca Grau and Boris Motik. 2012. Reasoning over Ontologies with Hidden Content: The Import-by-Query Approach. J. Artif. Intell. Res., Vol. 45 (2012), 197--255.
[13]
Ian Horrocks, Oliver Kutz, and Ulrike Sattler. 2006. The Even More Irresistible SROIQ. In Proc. KR'06. AAAI Press, 57--67.
[14]
Maulik R. Kamdar, Tania Tudorache, and Mark A. Musen. 2017. A systematic analysis of term reuse and term overlap across biomedical ontologies. Semantic Web, Vol. 8, 6 (2017), 853--871.
[15]
Megan Katsumi and Michael Grü ninger. 2016. What Is Ontology Reuse?. In Proc. FOIS'16, Vol. 283. IOS Press, 9--22.
[16]
Michel C. A. Klein and Dieter Fensel. 2001. Ontology versioning on the Semantic Web. In Proc. SWWS'01. 75--91.
[17]
Michel C. A. Klein, Dieter Fensel, Atanas Kiryakov, and Damyan Ognyanov. 2002. Ontology Versioning and Change Detection on the Web. In Proc. EKAW'02 (Lecture Notes in Computer Science, Vol. 2473). Springer, 197--212.
[18]
Boris Konev, Michel Ludwig, Dirk Walther, and Frank Wolter. 2012. The Logical Difference for the Lightweight Description Logic $mathcalEL$. J. Artif. Intell. Res., Vol. 44 (2012), 633--708.
[19]
Boris Konev, Carsten Lutz, Dirk Walther, and Frank Wolter. 2013. Model-theoretic inseparability and modularity of description logic ontologies. Artif. Intell., Vol. 203 (2013), 66--103.
[20]
Boris Konev, Dirk Walther, and Frank Wolter. 2008. The Logical Difference Problem for Description Logic Terminologies. In IJCAR (Lecture Notes in Computer Science, Vol. 5195). Springer, 259--274.
[21]
Boris Konev, Dirk Walther, and Frank Wolter. 2009. Forgetting and Uniform Interpolation in Large-Scale Description Logic Terminologies. In Proc. IJCAI'09. IJCAI/AAAI Press, 830--835.
[22]
Roman Kontchakov, Frank Wolter, and Michael Zakharyaschev. 2010. Logic-based ontology comparison and module extraction, with an application to DL-Lite. Artif. Intell., Vol. 174, 15 (2010), 1093--1141.
[23]
Patrick Koopmann. 2015. Practical Uniform Interpolation for Expressive Description Logics. Ph.,D. Dissertation. The University of Manchester, UK.
[24]
Patrick Koopmann. 2020. LETHE: Forgetting and Uniform Interpolation for Expressive Description Logics. Kü nstliche Intell., Vol. 34, 3 (2020), 381--387.
[25]
Patrick Koopmann, Warren Del-Pinto, Sophie Tourret, and Renate A. Schmidt. 2020. Signature-Based Abduction for Expressive Description Logics. In Proc. KR'20. IJCAI Organization, 592--602.
[26]
Patrick Koopmann and Renate A. Schmidt. 2013. Implementation and Evaluation of Forgetting in $mathcalALC$-Ontologies. In Proc. WoMo'13, Vol. 1081. CEUR-WS.org, 1--12.
[27]
Patrick Koopmann and Renate A. Schmidt. 2015. LETHE: Saturation-Based Reasoning for Non-Standard Reasoning Tasks. In Proc. DL'15 (CEUR Workshop Proceedings, Vol. 1387). CEUR-WS.org, 23--30.
[28]
Patrick Lambrix and He Tan. 2008. Ontology Alignment and Merging. In Anatomy Ontologies for Bioinformatics, Principles and Practice. Computational Biology, Vol. 6. Springer, 133--149.
[29]
Jiaqi Li, Xuan Wu, Chang Lu, Wenxing Deng, and Yizheng Zhao. 2021. Computing Views of OWL Ontologies for the Semantic Web. In Proc. WWW'21. ACM/IW3C2, 2624--2635.
[30]
Zhao Liu, Chang Lu, Ghadah Alghamdi, Renate A. Schmidt, and Yizheng Zhao. 2021. Tracking Semantic Evolutionary Changes in Large-Scale Ontological Knowledge Bases. In Proc. CIKM'21. ACM, 1130--1139.
[31]
Michel Ludwig and Boris Konev. 2014. Practical Uniform Interpolation and Forgetting for $mathcalALC$ TBoxes with Applications to Logical Difference. In Proc. KR'14. AAAI Press.
[32]
Carsten Lutz, Inancc Seylan, and Frank Wolter. 2012. An Automata-Theoretic Approach to Uniform Interpolation and Approximation in the Description Logic EL. In Proc. KR'12. AAAI Press, 286--296.
[33]
Carsten Lutz, Dirk Walther, and Frank Wolter. 2007. Conservative Extensions in Expressive Description Logics. In Proc. IJCAI'07. AAAI/IJCAI Press, 453--458.
[34]
Carsten Lutz and Frank Wolter. 2010. Deciding inseparability and conservative extensions in the description logic $mathcalEL$. J. Symb. Comput., Vol. 45, 2 (2010), 194--228.
[35]
Carsten Lutz and Frank Wolter. 2011. Foundations for Uniform Interpolation and Forgetting in Expressive Description Logics. In Proc. IJCAI'11. IJCAI/AAAI Press, 989--995.
[36]
Nicolas Matentzoglu and Bijan Parsia. 2017. BioPortal Snapshot 30.03.2017. https://doi.org/10.5281/zenodo.439510
[37]
Boris Motik, Ian Horrocks, and Ulrike Sattler. 2007. Bridging the gap between OWL and relational databases. In Proc. WWW'07. ACM, 807--816.
[38]
Nadeschda Nikitina and Sebastian Rudolph. 2014. (Non-)Succinctness of uniform interpolants of general terminologies in the description logic $mathcalEL$. Artif. Intell., Vol. 215 (2014), 120--140.
[39]
Nadeschda Nikitina, Sebastian Rudolph, and Birte Glimm. 2011. Reasoning-Supported Interactive Revision of Knowledge Bases. In Proc. IJCAI'11. IJCAI/AAAI, 1027--1032.
[40]
Natalya Fridman Noy and Mark A. Musen. 2000. PROMPT: Algorithm and Tool for Automated Ontology Merging and Alignment. In Proc. AAAI/IAAI'00. AAAI Press/The MIT Press, 450--455.
[41]
David A. Plaisted and Steven Greenbaum. 1986. A Structure-Preserving Clause Form Translation. J. Symb. Comput., Vol. 2, 3 (1986), 293--304.
[42]
Má rcio Moretto Ribeiro and Renata Wassermann. 2009. Base Revision for Ontology Debugging. J. Log. Comput., Vol. 19, 5 (2009), 721--743.
[43]
John Alan Robinson and Andrei Voronkov (Eds.). 2001. Handbook of Automated Reasoning (in 2 volumes). Elsevier and MIT Press.
[44]
Manfred Schmidt-Schauß and Gert Smolka. 1991. Attributive Concept Descriptions with Complements. Artif. Intell., Vol. 48, 1 (1991), 1--26.
[45]
Dan Schrimpsher, Zhiqiang Wu, Anthony M. Orme, and Letha H. Etzkorn. 2010. Dynamic ontology version control. In Proc. ACMse'10. ACM, 25.
[46]
Elena Simperl. 2009. Reusing ontologies on the Semantic Web: A feasibility study. Data Knowl. Eng., Vol. 68, 10 (2009), 905--925.
[47]
Nicolas Troquard, Roberto Confalonieri, Pietro Galliani, Rafael Pe n aloza, Daniele Porello, and Oliver Kutz. 2018. Repairing Ontologies via Axiom Weakening. In Proc. AAAI'18. AAAI Press, 1981--1988.
[48]
Chiara Del Vescovo, Matthew Horridge, Bijan Parsia, Uli Sattler, Thomas Schneider, and Haoruo Zhao. 2020. Modular Structures and Atomic Decomposition in Ontologies. J. Artif. Intell. Res., Vol. 69 (2020), 963--1021.
[49]
Kewen Wang, Grigoris Antoniou, Rodney Topor, and Abdul Sattar. 2005. Merging and Aligning Ontologies in dl-Programs. In Proc. RuleML'05 (Lecture Notes in Computer Science, Vol. 3791). Springer, 160--171.
[50]
Zhe Wang, Kewen Wang, Rodney W. Topor, and Jeff Z. Pan. 2010. Forgetting for knowledge bases in DL-Lite. Ann. Math. Artif. Intell., Vol. 58, 1--2 (2010), 117--151.
[51]
Xuan Wu, Wenxing Deng, Chang Lu, Hao Feng, and Yizheng Zhao. 2020. UI-FAME: A High-Performance Forgetting System for Creating Views of Ontologies. In Proc. CIKM'20. ACM, 3473--3476.
[52]
Yizheng Zhao, Ghadah Alghamdi, Schmidt Renate A., Hao Feng, Giorgos Stoilos, Damir Juric, and Mohammad Khodadadi. 2019. Tracking Logical Difference in Large-Scale Ontologies: A Forgetting-Based Approach. In Proc. AAAI'19. AAAI Press, 3116--3124.

Index Terms

  1. Highly-Optimized Forgetting for Creating Signature-Based Views of Ontologies

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image ACM Conferences
      CIKM '23: Proceedings of the 32nd ACM International Conference on Information and Knowledge Management
      October 2023
      5508 pages
      ISBN:9798400701245
      DOI:10.1145/3583780
      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].

      Sponsors

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 21 October 2023

      Permissions

      Request permissions for this article.

      Check for updates

      Author Tags

      1. description logics
      2. forgetting
      3. ontologies
      4. uniform interpolation

      Qualifiers

      • Research-article

      Funding Sources

      Conference

      CIKM '23
      Sponsor:

      Acceptance Rates

      Overall Acceptance Rate 1,861 of 8,427 submissions, 22%

      Upcoming Conference

      CIKM '25

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • 0
        Total Citations
      • 97
        Total Downloads
      • Downloads (Last 12 months)54
      • Downloads (Last 6 weeks)3
      Reflects downloads up to 21 Dec 2024

      Other Metrics

      Citations

      View Options

      Login options

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Media

      Figures

      Other

      Tables

      Share

      Share

      Share this Publication link

      Share on social media