On Instance-level Update and Erasure in Description Logic Ontologies

@article{DeGiacomo2009OnIU,
  title={On Instance-level Update and Erasure in Description Logic Ontologies},
  author={Giuseppe De Giacomo and Maurizio Lenzerini and Antonella Poggi and Riccardo Rosati},
  journal={J. Log. Comput.},
  year={2009},
  volume={19},
  pages={745-770}
}
A Description Logic (DL) ontology is constituted by two components, a TBox that expresses general knowledge about the concepts and their relationships, and an ABox that describes the properties of individuals that are instances of concepts. We address the problem of how to deal with changes to a DL ontology, when these changes affect only the ABox, i.e. when the TBox is considered invariant. We consider two basic changes, namely instance-level update and instance-level erasure, roughly… 

Figures from this paper

Foundations of instance level updates in expressive description logics

Instance-Level Update in DL-Lite Ontologies through First-Order Rewriting

It is shown that DL-LiteA, which is well-known for enjoying first- order rewritability of query answering, enjoys a first-order rewritable property also for instance-level update, which means that every update can be reformulated into a set of insertion and deletion instructions computable through a non-recursive Datalog program with negation.

On the evolution of the instance level of DL-Lite knowledge bases

This paper introduces a formula-based approach to updating the instance level of knowledge bases expressed in Description Logic by revisiting some research work on formulabased updates developed in the ’80s, in particular the WIDTIO (When In Doubt, Throw It Out) approach.

On the Evolution of the Instance Level of DL-Lite Knowledge Bases

This paper introduces a formula-based approach to updating the instance level of knowledge bases expressed in Description Logic, by revisiting some research work on formulabased updates developed in the '80s, in particular the WIDTIO (When In Doubt, Throw It Out) approach.

Actions and Programs over Description Logic Knowledge Bases: A Functional Approach

The effectiveness of the approach is demonstrated by introducing Golog/ConGolog-like high-level programs on DL KBs, characterizing the notion of single-step executability of such programs, and devising nice methods for reasoning about sequences of actions generated by such programs.

1 Actions and Programs over Description Logic Knowledge Bases : A Functional Approach

The effectiveness of the approach is demonstrated by introducing Golog/ConGolog-like high-level programs on DL KBs, characterizing the notion of single-step executability of such programs, and devising nice methods for reasoning about sequences of actions generated by such programs.

Capturing Instance Level Ontology Evolution for DL-Lite

This work proposed techniques to capture DL-Lite evolution corresponding to a well-known Winslett's approach in a DL SHOIQ (which is subsumed by OWL 2 DL) and showed how to approximate this evolution in DL- lite.

Updating ABoxes in DL-Lite

Two novel formula-based approaches are proposed and for each of them a polynomial time algorithm is developed to com- pute ABox updates for the Description Logic DL-LiteFR.

DL-Lite Ontology Revision Based on An Alternative Semantic Characterization

The usefulness of the new semantic characterization in ontology change is demonstrated, and two revision operators for DL-Lite KBs using featured models are defined, and it is shown that these two operators both satisfy AGM postulates.

On expansion and contraction of DL-Lite knowledge bases

...

References

SHOWING 1-10 OF 40 REFERENCES

On the Update of Description Logic Ontologies at the Instance Level

This work provides a general semantics for instance level update in Description Logics, and shows that DL-Lite is closed with respect to instancelevel update, in the sense that the result of an update is always expressible as a new DL- lite ABox.

On the Approximation of Instance Level Update and Erasure in Description Logics

This work addresses the problem of how to deal with changes to a Description Logic knowledge base, when these changes affect only its ABox, and introduces the notion of best approximation of an update (erasure) in a DL L, with the goal of characterizing the L ABoxes that capture the update at best.

DL-Lite: Tractable Description Logics for Ontologies

DL-Lite is proposed, a new Description Logic specifically tailored to capture basic ontology languages, while keeping low complexity of reasoning, and shows that in DL-LITE the usual DL reasoning tasks are polynomial in the size of the TBox, and query answering is polynometric in theSize of the ABox, the first result of polynomic data complexity for query answering over DL knowledge bases.

Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family

It is shown that, for the DLs of the DL-Lite family, the usual DL reasoning tasks are polynomial in the size of the TBox, and query answering is LogSpace in thesize of the ABox, which is the first result ofPolynomial-time data complexity for query answering over DL knowledge bases.

Linking Data to Ontologies

This paper presents a new ontology language, based on Description Logics, that is particularly suited to reason with large amounts of instances and a novel mapping language that is able to deal with the so-called impedance mismatch problem.

Updating Description Logic ABoxes

This paper considers the problem of updating ABoxes when the state changes and analyzes such basic ABox updates in several standard DLs by investigating whether the updated ABox can be expressed in these DLs and, if so, whether it is computable and what is its size.

QuOnto: Querying Ontologies

The need of efficient reasoning algorithms is of paramount importance when the ontology system is to manage large amount of objects, as in the case of several important applications where the use of ontologies is advocated nowadays.

Integrating Description Logics and Action Formalisms: First Results

This paper performs a detailed investigation of how the choice of the DL influences the complexity of the standard reasoning tasks executability and projection in the corresponding action formalism.

The Description Logic Handbook: Theory, Implementation, and Applications

This new edition of The Description Logic Handbook provides a thorough account of the subject, covering all aspects of research in this field, namely: theory, implementation, and applications.

Data Complexity of Query Answering in Description Logics