Efficient Computation of Signature-Restricted Views for Semantic Web Ontologies
Pages 1945 - 1953
Abstract
Uniform Interpolation (UI) is an advanced reasoning service used to narrow down an ontology to a restricted view. This new ontology, known as a uniform interpolant, will only consist of the ''relevant names'', yet it will retain their original meanings. UI is immensely promising due to its applicability across various domains where custom views of ontologies are essential. Nonetheless, to unlock its full potential, we need optimized techniques to generate these tailored views. Previous studies suggest that creating uniform interpolants for EL-ontologies is notably challenging. In some instances, it is not even feasible to compute a uniform interpolant; when feasible, the size of the uniform interpolant can be up to triple exponentially larger than the source ontology. Despite these challenges, our paper introduces an improved ''forgetting'' technique specifically designed for computing uniform interpolants of ELI-ontologies. We demonstrate that, with good normalization and inference strategies, such uniform interpolants can be efficiently computed, just as quickly as computing ''modules''. A comprehensive evaluation with a prototypical implementation of the method shows superb success rates over two popular benchmark datasets, demonstrating a clear computational advantage over state-of-the-art approaches.
Supplemental Material
MP4 File
presentation video
- Download
- 1796.48 MB
MP4 File
Supplemental video
- Download
- 10.69 MB
References
[1]
Wilhelm Ackermann. 1935. Untersuchungen ú ber das Eliminationsproblem der mathematischen Logik. Math. Ann., Vol. 110, 1 (1935), 390--413.
[2]
Grigoris Antoniou and Frank van Harmelen. 2004. Web Ontology Language: OWL. Springer Berlin Heidelberg, 67--92.
[3]
Franz Baader, Ian Horrocks, Carsten Lutz, and Ulrike Sattler. 2017. An Introduction to Description Logic. Cambridge University Press.
[4]
Leo Bachmair, Harald Ganzinger, David A. McAllester, and Christopher Lynch. 2001. Resolution Theorem Proving. See citeNDBLP:books/el/RobinsonV01, 19--99.
[5]
George Boole. 1854. An Investigation of the Laws of Thought. Walton & Maberly.
[6]
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.
[7]
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.
[8]
Warren Del-Pinto and Renate A. Schmidt. 2019. ABox Abduction via Forgetting in $mathcalALC$. In Proc. AAAI'19. AAAI Press, 2768--2775.
[9]
Christian G. Fermü ller, Alexander Leitsch, Ullrich Hustadt, and Tanel Tammet. 2001. Resolution Decision Procedures. See citeNDBLP:books/el/RobinsonV01, 1791--1849.
[10]
Dov M. Gabbay, Renate A. Schmidt, and Andrzej Szalas. 2008. Second-Order Quantifier Elimination - Foundations, Computational Aspects and Applications. Studies in logic : Mathematical logic and foundations, Vol. 12. College Publications.
[11]
William Gatens, Boris Konev, and Frank Wolter. 2014. Lower and Upper Approximations for Depleting Modules of Description Logic Ontologies. In Proc. ECAI'14 (Frontiers in Artificial Intelligence and Applications, Vol. 263). IOS Press, 345--350.
[12]
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.
[13]
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.
[14]
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.
[15]
Ian Horrocks. 2008. Ontologies and the semantic web. Commun. ACM, Vol. 51, 12 (2008), 58--67.
[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 Proc. IJCAR'14 (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. 592--602.
[26]
Patrick Koopmann and Renate A. Schmidt. 2013a. 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. 2013b. Uniform Interpolation of $mathcalALC$-Ontologies Using Fixpoints. In Proc. FroCos'13 (Lecture Notes in Computer Science, Vol. 8152). Springer, 87--102.
[28]
Patrick Koopmann and Renate A. Schmidt. 2015. Uniform Interpolation and Forgetting for $mathcalALC$-Ontologies with ABoxes. In Proc. AAAI'15. AAAI Press, 175--181.
[29]
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.
[30]
Fangzhen Lin and Ray Reiter. 1994. Forget It!. In Proc. AAAI Fall Symposium on Relevance. AAAI Press, 154--159.
[31]
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.
[32]
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, 318--327.
[33]
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.
[34]
Carsten Lutz, Dirk Walther, and Frank Wolter. 2007. Conservative Extensions in Expressive Description Logics. In Proc. IJCAI'07. AAAI/IJCAI Press, 453--458.
[35]
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.
[36]
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.
[37]
Nicolas Matentzoglu and Bijan Parsia. 2017. BioPortal Snapshot 30.03.2017. https://doi.org/10.5281/zenodo.439510
[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]
Peter Plessers and Olga De Troyer. 2005. Ontology Change Detection Using a Version Log. In Proc. ISWC'05 (Lecture Notes in Computer Science, Vol. 3729). Springer, 578--592.
[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]
Ana Armas Romero, Mark Kaminski, Bernardo Cuenca Grau, and Ian Horrocks. 2016. Module Extraction in Expressive Ontology Languages via Datalog Reasoning. J. Artif. Intell. Res., Vol. 55 (2016), 499--564.
[45]
Manfred Schmidt-Schauß and Gert Smolka. 1991. Attributive Concept Descriptions with Complements. Artif. Intell., Vol. 48, 1 (1991), 1--26.
[46]
Dan Schrimpsher, Zhiqiang Wu, Anthony M. Orme, and Letha H. Etzkorn. 2010. Dynamic ontology version control. In Proc. ACMse'10. ACM, 25.
[47]
Nigel Shadbolt, Tim Berners-Lee, and Wendy Hall. 2006. The Semantic Web Revisited. IEEE Intell. Syst., Vol. 21, 3 (2006), 96--101.
[48]
Steffen Staab and Rudi Studer (Eds.). 2009. Handbook on Ontologies. Springer.
[49]
Stephan Tobies. 2001. Complexity results and practical algorithms for logics in knowledge representation. Ph.,D. Dissertation. RWTH Aachen University, Germany.
[50]
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.
[51]
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.
[52]
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.
[53]
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.
[54]
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.
[55]
Yue Xiang, Xuan Wu, Chang Lu, and Yizheng Zhao. 2022. Creating Signature-Based Views for Description Logic Ontologies with Transitivity and Qualified Number Restrictions. In Proc. WWW'22. ACM, 808--817.
[56]
Hui Yang, Patrick Koopmann, Yue Ma, and Nicole Bidoit. 2023. Efficient Computation of General Modules for ALC Ontologies. In Proc. IJCAI'23. ijcai.org, 3356--3364.
[57]
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.
[58]
Yizheng Zhao and Renate A. Schmidt. 2018. FAME: An Automated Tool for Semantic Forgetting in Expressive Description Logics. In Proc. IJCAR'18 (Lecture Notes in Computer Science, Vol. 10900). Springer, 19--27. io
Index Terms
- Efficient Computation of Signature-Restricted Views for Semantic Web Ontologies
Recommendations
Computing Views of OWL Ontologies for the Semantic Web
WWW '21: Proceedings of the Web Conference 2021This paper tackles the problem of computing views of OWL ontologies using a forgetting-based approach. In traditional relational databases, a view is a subset of a database, whereas in ontologies, a view is more than a subset; it contains not only ...
Highly-Optimized Forgetting for Creating Signature-Based Views of Ontologies
CIKM '23: Proceedings of the 32nd ACM International Conference on Information and Knowledge ManagementUniform 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, ...
(Non-)Succinctness of uniform interpolants of general terminologies in the description logic EL
EL is a popular description logic, used as a core formalism in large existing knowledge bases. Uniform interpolants of knowledge bases are of high interest, e.g. in scenarios where a knowledge base is supposed to be partially reused. However, to the ...
Comments
Information & Contributors
Information
Published In
May 2024
4826 pages
ISBN:9798400701719
DOI:10.1145/3589334
- General Chairs:
- Tat-Seng Chua,
- Chong-Wah Ngo,
- Proceedings Chair:
- Roy Ka-Wei Lee,
- Program Chairs:
- Ravi Kumar,
- Hady W. Lauw
Copyright © 2024 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].
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 13 May 2024
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
Conference
WWW '24
Sponsor:
Acceptance Rates
Overall Acceptance Rate 1,899 of 8,196 submissions, 23%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 185Total Downloads
- Downloads (Last 12 months)185
- Downloads (Last 6 weeks)23
Reflects downloads up to 05 Mar 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in