The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Modular Reuse of Ontologies: Theory and Practice
Open accessAbstract
In this paper, we propose a set of tasks that are relevant for the modular reuse of ontologies. In order to formalize these tasks as reasoning problems, we introduce the notions of conservative extension, safety and module for a very general class of logic-based ontology languages. We investigate the general properties of and relationships between these notions and study the relationships between the relevant reasoning problems we have previously identified. To study the computability of these problems, we consider, in particular, Description Logics (DLs), which provide the formal underpinning of the W3C Web Ontology Language (OWL), and show that all the problems we consider are undecidable or algorithmically unsolvable for the description logic underlying OWL DL. In order to achieve a practical solution, we identify conditions sufficient for an ontology to reuse a set of symbols ``safely''---that is, without changing their meaning. We provide the notion of a safety class, which characterizes any sufficient condition for safety, and identify a family of safety classes--called locality---which enjoys a collection of desirable properties. We use the notion of a safety class to extract modules from ontologies, and we provide various modularization algorithms that are appropriate to the properties of the particular safety class in use. Finally, we show practical benefits of our safety checking and module extraction algorithms.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Description Logic Handbook: Theory, Implementation and Applications
(2007) · Cambridge University Press eBooks · doi:10.1017/cbo9780511711787 · Cited by 6,147
The Description Logic Handbook – Theory, Implementation and Applications
Mann, C. J. H. (2003) · Kybernetes · doi:10.1108/k.2003.06732iae.006 · Cited by 2,224
From SHIQ and RDF to OWL: the making of a Web Ontology Language
Horrocks, I., Patel-Schneider, P. F., & van Harmelen, F. (2003) · Journal of Web Semantics · doi:10.1016/j.websem.2003.07.001 · Cited by 1,491
Self-citation(2004) · Springer eBooks · doi:10.1007/978-3-540-24750-0 · Cited by 1,442
Ontology mapping: the state of the art
Kalfoglou, Y., & Schorlemmer, M. (2003) · The Knowledge Engineering Review · doi:10.1017/s0269888903000651 · Cited by 1,332
The Description Logic Handbook: Theory, Implementation, and Applications
Baader, F., Calvanese, D., McGuinness, D. L., Nardi, D., & Patel‐Schneider, P. F. (2003) · doi:10.5555/885746 · Cited by 1,066
Semantic integration: a survey of ontology-based approaches
Noy, N. F. (2004) · ACM SIGMOD Record · doi:10.1145/1041410.1041421 · Cited by 1,019
Attributive concept descriptions with complements
Schmidt-Schauß, M., & Smolka, G. (1991) · Artificial Intelligence · doi:10.1016/0004-3702(91)90078-x · Cited by 962
Baader, F., Brandt, S., & Lutz, C. (2005) · Qucosa (Saxon State and University Library Dresden) · Cited by 902
The Classical Decision Problem
Börger, E., Grädel, E., & Gurevich, Y. (1997) · Springer eBooks · doi:10.1007/978-3-642-59207-2 · Cited by 816
Cited by
Ontologies and the semantic web
Horrocks, I. (2008) · Communications of the ACM · doi:10.1145/1409360.1409377 · Cited by 639
Self-citationLiu, X., Wang, X., Wright, G., Cheng, J., Li, X., & Liu, R. (2017) · ISPRS International Journal of Geo-Information · doi:10.3390/ijgi6020053 · Cited by 398
Towards an Ontology for Robot Introspection and Metacognition
Nolte, R., Pomarlan, M., Bessler, D., Porzel, R., Malaka, R., & Bateman, J. A. (2023) · Frontiers in Artificial Intelligence and Applications · doi:10.3233/faia231137 · Cited by 3
Metadata
- Authors
- Cuenca Grau, B., Horrocks, I., Kazakov, Y., & Sattler, U.
- Venue
- Journal of Artificial Intelligence Research
- Publisher
- AI Access Foundation
- Published
- 2008-02-22
- Volume
- 31
- Pages
- 273-318
- ISSN
- 1076-9757 (ISSN-L)
- OpenAlex
- W2147729309
- Cited by
- 413
- References
- 16
- FWCI
- 56.71
- Type
- journal article
- Language
- en
- Open access
- diamond
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.