Capturing model-based ontology evolution at the instance level: the case of DL-Lite (Q389229): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: DBLP publication ID (P1635): journals/jcss/KharlamovZC13, #quickstatements; #temporary_batch_1731468600454 |
||
Property / DBLP publication ID | |||
Property / DBLP publication ID: journals/jcss/KharlamovZC13 / rank | |||
Normal rank |
Latest revision as of 04:35, 13 November 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Capturing model-based ontology evolution at the instance level: the case of DL-Lite |
scientific article |
Statements
Capturing model-based ontology evolution at the instance level: the case of DL-Lite (English)
0 references
20 January 2014
0 references
The evolution (via updates or revisions) of knowledge bases (KBs) expressed in description logics (DLs) has mostly focused on so-called model-based approaches (MBAs), where the evolution of a KB results in a set of models. From the authors' abstract: For KBs expressed in tractable DLs, such as those of the DL-Lite family, which we consider here, it has been shown that one faces inexpressibility of evolution, i.e., the result of evolution of a DL-Lite KB in general cannot be expressed in DL-Lite, in other words, DL-Lite is not closed under evolution. What is still missing in these studies is a thorough understanding of various important aspects of the evolution problem for DL-Lite KBs: Which fragments of DL-Lite are closed under evolution? What causes the inexpressibility? Can one approximate evolution in DL-Lite, and if yes, how? This work provides some understanding of these issues for an important class of MBAs, which cover the cases of both update and revision. We describe what causes inexpressibility, and we propose techniques (based on what we call prototypes) that help to approximate evolution under the well-known approach by Winslett, which is inexpressible in DL-Lite. We also identify a fragment of DL-Lite closed under evolution, and for this fragment we provide polynomial-time algorithms to compute or approximate evolution results for various MBAs.
0 references
knowledge base evolution
0 references
description logics
0 references
DL-Lite
0 references
knowledge base update
0 references
knowledge base revision
0 references
formal evolution semantics
0 references
closure under evolution
0 references
semantic web
0 references
0 references
0 references