skip to main content
10.1145/3340531.3417412acmconferencesArticle/Chapter ViewAbstractPublication PagescikmConference Proceedingsconference-collections
short-paper

UI-FAME

Published: 19 October 2020 Publication History

Abstract

This paper describes a Java-based forgetting system UI-FAME for creating views of ontologies. In relational databases, a view is a subset of the database, while in ontologies, a view is more than a subset; it contains not only axioms that are contained in the original ontology, but also newly-derived axioms that are entailed by the original ontology. Forgetting is a form of non-standard reasoning that can be used to create views of ontologies by eliminating from the ontologies a set of concept and role names, namely the forgetting signature, while keeping all logical consequences over the names in the remaining signature. We compared UI-FAME with publicly accessible forgetting systems, namely LETHE and an early prototypical version of UI-FAME, over the 'AL'-TBox fragment of 494 ontologies taken from the Oxford Ontology Library. The results showed that UI-FAME had better success rates than LETHE and its prototypical version, and outsped LETHE by a large margin. UI-FAME has been integrated as back-end support in Babylon Health's (a leading digital healthcare company based in London) knowledge base (formed by the merger and alignment of medical ontologies from different sources) interfaces for their main concerns of ontology analysis and keeping track of the changes in different versions of its knowledge base.

Supplementary Material

MP4 File (3340531.3417412.mp4)
This video describes a Java-based forgetting system UI-FAME for creating views of ontologies. In relational databases, a view is a subset of the database, while in ontologies, a view is more than a subset; it contains not only axioms that are contained in the original ontology, but also newly-derived axioms that are entailed by the original ontology. Forgetting is a form of non-standard reasoning that can be used to create views of ontologies by eliminating from the ontologies a set of concept and role names, namely the forgetting signature, while keeping all logical consequences over the names in the remaining signature.

References

[1]
W. Ackermann. Untersuchungen $ddotu$ber das Eliminationsproblem der mathematischen Logik. Mathematische Annalen, 110(1):390--413, 1935.
[2]
F. Baader, I. Horrocks, C. Lutz, and U. Sattler. An Introduction to Description Logic. Cambridge University Press, 2017.
[3]
L. Bachmair, H. Ganzinger, D. A. McAllester, and C. Lynch. Resolution theorem proving. In Robinson and Voronkov citeDBLP:books/el/RobinsonV01, pages 19--99.
[4]
C. G. Fermüller, A. Leitsch, U. Hustadt, and T. Tammet. Resolution decision procedures. In Robinson and Voronkov citeDBLP:books/el/RobinsonV01, pages 1791--1849.
[5]
B. C. Grau and B. Motik. Reasoning over ontologies with hidden content: The import-by-query approach. J. Artif. Intell. Res., 45:197--255, 2012.
[6]
B. Konev, M. Ludwig, D. Walther, and F. Wolter. The Logical Difference for the Lightweight Description Logic EL.J. Artif. Intell. Res., 44:633--708, 2012.
[7]
B. Konev, D. Walther, and F. Wolter. The Logical Difference Problem for Description Logic Terminologies. In IJCAR, volume 5195 of Lecture Notes in Computer Science, pages 259--274. Springer, 2008.
[8]
B. Konev, D. Walther, and F. Wolter. Forgetting and Uniform Interpolation in Large-Scale Description Logic Terminologies. In Proc. IJCAI'09, pages 830--835. IJCAI/AAAI Press, 2009.
[9]
P. Koopmann. Practical Uniform Interpolation for Expressive Description Logics. PhD thesis, The University of Manchester, UK, 2015.
[10]
M. Ludwig and B. Konev. Practical Uniform Interpolation and Forgetting TBoxes with Applications to Logical Difference. In Proc. KR'14. AAAI Press, 2014.
[11]
N. F. Noy and M. A. Musen. PROMPT: Algorithm and Tool for Automated Ontology Merging and Alignment. In Proc. AAAI/IAAI'00, pages 450--455. AAAI Press/The MIT Press, 2000.
[12]
M. Ortiz. Ontology based query answering: The story so far. In Proc. AMW'13, volume 1087 of CEUR Workshop Proceedings. CEUR-WS.org, 2013.
[13]
J. A. Robinson and A. Voronkov, editors. Handbook of Automated Reasoning (in 2 volumes). Elsevier and MIT Press, 2001.
[14]
K. A. Spackman. SNOMED RT and SNOMED CT. promise of an international clinical ontology. M.D. Computing 17, 2000.
[15]
N. Troquard, R. Confalonieri, P. Galliani, R. Peñaloza, D. Porello, and O. Kutz. Repairing Ontologies via Axiom Weakening. In Proc. AAAI'18, pages 1981--1988. AAAI Press, 2018.
[16]
Y. Zhao, G. Alghamdi, R. A. Schmidt, H. Feng, G. Stoilos, D. Juric, and M. Khodadadi. Tracking Logical Difference in Large-Scale Ontologies: A Forgetting-Based Approach. In Proc. AAAI'19, pages 3116--3124. AAAI Press, 2019.
[17]
Y. Zhao, R. A. Schmidt, Y. Wang, X. Zhang, and H. Feng. A practical approach to forgetting in description logics with nominals. In Proc. AAAI'20, pages 3073--3079. AAAI Press, 2020.

Cited By

View all
  • (2024)Efficient Computation of Signature-Restricted Views for Semantic Web OntologiesProceedings of the ACM Web Conference 202410.1145/3589334.3645317(1945-1953)Online publication date: 13-May-2024

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
CIKM '20: Proceedings of the 29th ACM International Conference on Information & Knowledge Management
October 2020
3619 pages
ISBN:9781450368599
DOI:10.1145/3340531
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 ACM 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: 19 October 2020

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. description logics
  2. forgetting
  3. ontology
  4. semantics

Qualifiers

  • Short-paper

Funding Sources

Conference

CIKM '20
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

  • Downloads (Last 12 months)10
  • Downloads (Last 6 weeks)0
Reflects downloads up to 18 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2024)Efficient Computation of Signature-Restricted Views for Semantic Web OntologiesProceedings of the ACM Web Conference 202410.1145/3589334.3645317(1945-1953)Online publication date: 13-May-2024

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