#### DMCA

## Evolution of DL-Lite Knowledge Bases

### Cached

### Download Links

Citations: | 36 - 17 self |

### Citations

468 | Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family
- Calvanese, Giacomo, et al.
- 2007
(Show Context)
Citation Context ...r Winslett’s semantics [10, 11], and the approaches proposed in [8], fit nicely into our classification. Regarding Items (iii) and (iv), we concentrate our technical development on the DL-Lite family =-=[12]-=-, which is at the basis of OWL 2 QL, one of the tractable profiles of OWL 2. We exhibit limitations of a number of model-based approaches for the logics of the DL-Lite family: besides the fact that ev... |

466 | On the difference between updating a knowledge base and revising it
- Katsuno, Mendelzon
- 1992
(Show Context)
Citation Context ...wledge. Different choices are possible, corresponding to different semantics for KB evolution [3–8]. In the literature, two main types of KB evolution have been considered: namely revision and update =-=[4]-=-. Both have a precise formal grounding in terms of postulates [4, 5] and a number of update and revision operators were proposed in the literature [6, 5]. This work has been carried out for propositio... |

291 | Investigations into a theory of knowledge base revision
- Dalal
- 1988
(Show Context)
Citation Context ... MBAs proposed by Winslett [6] and Forbus [17] correspond, respectively, to L⊆, and L♯, while the one by Borgida [18] is a variant of L⊆. The two classical global MBAs proposed by Satoh [5] and Dalal =-=[19]-=- correspond, respectively, to G⊆, and G♯. Under each of our eight semantics, evolution results in a set of interpretations. In the propositional case each set of interpretations over finitely many sym... |

213 | On the complexity of propositional knowledge base revision, updates, and counterfactuals
- Eiter, Gottlob
- 1992
(Show Context)
Citation Context ...A, D, each satisfiable with T OUTPUT: finite set of membership assertions A w [1] A w := A [2] for each B1(c) ∈ D do [3] A w := A w \ {B1(c)} and [4] for each B2 ⊑ B1 ∈ cl(T ) do A w := A w \ {B2(c)} =-=[5]-=- if B2(c) = ∃R(c) then [6] for each R(c, d) ∈ A w do D := D ∪ {R(c, d)} [7] for each R1(a, b) ∈ D do [8] A w := A w \ {R1(a, b)} and [9] for each R2 ⊑ R1 ∈ cl(T ) do A w := A w \ {R2(a, b)} Fig. 2. Al... |

192 | M.: The DL-Lite family and relations
- Artale, Calvanese, et al.
- 2009
(Show Context)
Citation Context ... this family. The DL-Lite family has nice computational properties, for example, KB satisfiability has polynomial-time complexity in the size of the TBox and logarithmic-space in the size of the ABox =-=[14, 15]-=-. The semantics of DL-Lite KBs is given in the standard way, using first order interpretations, all over the same infinite countable domain ∆. An interpretation I is a function · I that assigns to eac... |

190 | Linking Data to Ontologies
- Poggi, Lembo, et al.
- 2008
(Show Context)
Citation Context ... this family. The DL-Lite family has nice computational properties, for example, KB satisfiability has polynomial-time complexity in the size of the TBox and logarithmic-space in the size of the ABox =-=[14, 15]-=-. The semantics of DL-Lite KBs is given in the standard way, using first order interpretations, all over the same infinite countable domain ∆. An interpretation I is a function · I that assigns to eac... |

160 | Reasoning about Action I: A Possible Worlds Approach
- Ginsberg, Smith
- 1988
(Show Context)
Citation Context ... of the paper we will discuss how to incorporate this new knowledge into our KB. 3 Approaches to Evolution A number of candidate semantics for evolution operators have been proposed in the literature =-=[6, 3, 16, 15, 8]-=-. They can be divided into two groups, model-based approaches (MBAs) and formula-based approaches (FBAs). 3.1 Model-Based Approaches In model-based approaches (MBAs) the result of evolution of a KB K ... |

133 |
Updating Logical Databases
- Winslett
- 1990
(Show Context)
Citation Context ... have been considered: namely revision and update [4]. Both have a precise formal grounding in terms of postulates [4, 5] and a number of update and revision operators were proposed in the literature =-=[6, 5]-=-. This work has been carried out for propositional logic, providing a thorough understanding of the various options, both wrt semantics and wrt computational properties. Work relevant to KB evolution ... |

104 | Language features for flexible handling of exceptions in information systems
- Borgida
- 1985
(Show Context)
Citation Context ... superscripts, to identify MBAs in that setting. Interestingly, the two classical local MBAs proposed by Winslett [6] and Forbus [17] correspond, respectively, to L⊆, and L♯, while the one by Borgida =-=[18]-=- is a variant of L⊆. The two classical global MBAs proposed by Satoh [5] and Dalal [19] correspond, respectively, to G⊆, and G♯. Under each of our eight semantics, evolution results in a set of interp... |

91 | Introducing actions into qualitative simulations
- Forbus
- 1989
(Show Context)
Citation Context ...olbased semantics is meaningless, we can also use our notation, without superscripts, to identify MBAs in that setting. Interestingly, the two classical local MBAs proposed by Winslett [6] and Forbus =-=[17]-=- correspond, respectively, to L⊆, and L♯, while the one by Borgida [18] is a variant of L⊆. The two classical global MBAs proposed by Satoh [5] and Dalal [19] correspond, respectively, to G⊆, and G♯. ... |

73 | Updating description logic ABoxes
- Liu, Lutz, et al.
- 2006
(Show Context)
Citation Context ... evolution, independently of the chosen semantics. (iv) While in propositional logic the result of an evolution step is always expressible in the same formalism, this does not hold in general for DLs =-=[10, 11]-=-. In this paper we address several of the points raised by the above observations, thus contributing substantially to a clarification of the problem In line with Item (i), we carry out our investigati... |

51 |
Conceptual modeling with description logics
- Borgida, Brachman
(Show Context)
Citation Context ...variants of OWL, the standard ontology language of the Semantic Web 1 . DLs have traditionally been used for modeling at the intensional level the static and structural aspects of application domains =-=[1]-=-. Recently, however, the scope of ontologies has broadened, and they are now used also for providing support in the maintenance and evolution phase of information systems. Moreover, ontologies are con... |

51 | An axiomatic model of dynamic schema evolution in objectbase management systems
- Peters, Oezsu
- 1997
(Show Context)
Citation Context ...1(c)} and [4] for each B2 ⊑ B1 ∈ cl(T ) do A w := A w \ {B2(c)} [5] if B2(c) = ∃R(c) then [6] for each R(c, d) ∈ A w do D := D ∪ {R(c, d)} [7] for each R1(a, b) ∈ D do [8] A w := A w \ {R1(a, b)} and =-=[9]-=- for each R2 ⊑ R1 ∈ cl(T ) do A w := A w \ {R2(a, b)} Fig. 2. Algorithm Weeding(T , A, D) for DL-LiteFR INPUT: TBox T , and ABoxes A, NA, each satisfiable with T OUTPUT: finite set of membership asser... |

47 | G.: Ontology change: classification and survey
- Flouris, Manakanatas, et al.
- 2008
(Show Context)
Citation Context ... it makes true and two distance functions were introduced, respectively based on symmetric difference and on the cardinality of symmetric difference, dist⊆(I, J ) = I ⊖ J and dist♯(I, J ) = |I ⊖ J |. =-=(2)-=- where the symmetric difference of two sets is defined as I ⊖J = (I \J )∪(J \I). Distances under dist⊆ are sets and are compared by set inclusion, that is, dist⊆(I1, J1) ≤ dist⊆(I2, J2) iff dist⊆(I1, ... |

38 |
Update semantics for incomplete databases
- Abiteboul, Grahne
- 1985
(Show Context)
Citation Context ... for details).12 Diego Calvanese, Evgeny Kharlamov, Werner Nutt, and Dmitriy Zheleznyakov INPUT: KBs K and N OUTPUT: a set Km ⊆ cl (K) of TBox and ABox assertions [1] Km := N ; S := cl(K) [2] repeat =-=[3]-=- choose some φ ∈ S; S := S \ {φ} [4] if {φ} ∪ Km is coherent then Km := Km ∪ {φ} [5] until S = ∅ Fig. 1. Algorithm BoldEvol(K, N ) for nondeterministic computation of Km Theorem 10. The algorithm Bold... |

35 | On the update of description logic ontologies at the instance level
- Giacomo, Lenzerini, et al.
- 2006
(Show Context)
Citation Context ...hich follows. Theorem 5. DL-Lite is not closed under evolution wrt La ⊆ and La ♯ . This holds already for the special cases of TBox evolution and ABox evolution with protected TBox. De Giacomo et al. =-=[21]-=- considered ABox evolution with protected TBox wrt La ⊆ semantics. They presented an algorithm to compute DL-LiteFR KBs that represent K ⋄ NA for DL-LiteFR KBs K and NA. As a consequence of Theorem 5,... |

32 | Model-based revision operators for terminologies in description logics, in
- Qi, Du
(Show Context)
Citation Context ...ons, both wrt semantics and wrt computational properties. Work relevant to KB evolution has been carried out initially in schema evolution in databases, cf., [9], and more recently for expressive DLs =-=[8, 7]-=-. However, for such richer representation formalisms, the picture is much less clear, and the various possibilities are far from being completely explored. (i) The fundamental distinction in DLs betwe... |

29 | On belief change in ontology evolution
- Flouris
(Show Context)
Citation Context ... w [1] A w := A [2] for each B1(c) ∈ D do [3] A w := A w \ {B1(c)} and [4] for each B2 ⊑ B1 ∈ cl(T ) do A w := A w \ {B2(c)} [5] if B2(c) = ∃R(c) then [6] for each R(c, d) ∈ A w do D := D ∪ {R(c, d)} =-=[7]-=- for each R1(a, b) ∈ D do [8] A w := A w \ {R1(a, b)} and [9] for each R2 ⊑ R1 ∈ cl(T ) do A w := A w \ {R2(a, b)} Fig. 2. Algorithm Weeding(T , A, D) for DL-LiteFR INPUT: TBox T , and ABoxes A, NA, e... |

27 | On instance-level update and erasure in description logic ontologies
- Giacomo, Lenzerini, et al.
- 2009
(Show Context)
Citation Context ... evolution, independently of the chosen semantics. (iv) While in propositional logic the result of an evolution step is always expressible in the same formalism, this does not hold in general for DLs =-=[10, 11]-=-. In this paper we address several of the points raised by the above observations, thus contributing substantially to a clarification of the problem In line with Item (i), we carry out our investigati... |

6 | A proof theory for DL-Lite, in
- Calvanese, Kharlamov, et al.
(Show Context)
Citation Context ...results is that on the one hand, the minimality of change principle introduces implicit disjunction in the evolved KB. On the other hand, DL-Lite can be embedded into a slight extension of Horn logic =-=[20]-=- and therefore does not allow one to express genuine disjunction. Technically, this can be expressed by saying that every DL-Lite KB that entails a disjunction of DL-Lite assertions entails one of the... |

4 | W.: Updating TBoxes in DL-Lite
- Zheleznyakov, Calvanese, et al.
- 2010
(Show Context)
Citation Context ... T can be checked in time O(|T | 2 × |A|), where |A| is the number of assertions of A. The O(|T | 2 ) complexity can be shown by reduction to satisfiability of sets of propositional Horn clauses (see =-=[22]-=- for details).12 Diego Calvanese, Evgeny Kharlamov, Werner Nutt, and Dmitriy Zheleznyakov INPUT: KBs K and N OUTPUT: a set Km ⊆ cl (K) of TBox and ABox assertions [1] Km := N ; S := cl(K) [2] repeat ... |

1 |
W.: Updating TBoxes in DL-Lite.In
- Zheleznyakov, Calvanese, et al.
- 2010
(Show Context)
Citation Context ... to T can be checked in time O(|T | 2 ×|A|), where|A| is the number of assertions of A. TheO(|T | 2 ) complexity can be shown by reduction to satisfiability of sets of propositional Horn clauses (see =-=[22]-=- for details).Evolution of DL-Lite Knowledge Bases 123 INPUT: KBs K and N OUTPUT: asetKm⊆ cl (K) of TBox and ABox assertions [1] Km := N ; S := cl(K) [2] repeat [3] choose some φ ∈S; S := S\{φ} [4] i... |