Filters








1,946 Hits in 3.5 sec

Evolution of DL − Lite Knowledge Bases [chapter]

Diego Calvanese, Evgeny Kharlamov, Werner Nutt, Dmitriy Zheleznyakov
2010 Lecture Notes in Computer Science  
We study the problem of evolution for Knowledge Bases (KBs) expressed in Description Logics (DLs) of the DL-Lite family.  ...  We show that known formula-based approaches are also not appropriate for DL-Lite evolution, either due to high complexity of computation, or because the result of such an action of evolution is not expressible  ...  Conclusion We studied evolution of DL-Lite KBs. There are two main families of approaches to evolution: model-based and formula-based ones.  ... 
doi:10.1007/978-3-642-17746-0_8 fatcat:pkgiifrbhbdplammyurrqnnw6a

Trust-Sensitive Evolution of DL-Lite Knowledge Bases

Dmitriy Zheleznyakov, Evgeny Kharlamov, Ian Horrocks
2017 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
Evolution of Knowledge Bases (KBs) consists of incorporating new information in an existing KB.  ...  We show that DL-Lite is not closed under a wide range of trust-sensitive MBAs.  ...  Closure of DL-Lite Under Evolution We now turn our attention to DL-Lite and show that evolution results in general cannot be axiomatised as DL-Lite KBs.  ... 
doi:10.1609/aaai.v31i1.10701 fatcat:oi7cvoit7bdxvda4hxig56yxra

On the evolution of the instance level of DL-lite knowledge bases [article]

Maurizio Lenzerini, Domenico Fabio Savo
2011 arXiv   pre-print
Also, we present polynomial time algorithms for the evolution of the instance level knowledge bases expressed in the most expressive Description Logics of the DL-lite family.  ...  Recent papers address the issue of updating the instance level of knowledge bases expressed in Description Logic following a model-based approach.  ...  Perhaps, the closest approach to the one proposed in this paper is that reported in [6] , where formula-based evolution (actually, insertion) of DL-Lite KBs is studied.  ... 
arXiv:1104.4053v1 fatcat:44rfawpnyjesxmkjx4ctaevzy4

Understanding Inexpressibility of Model-Based ABox Evolution in DL-Lite

Evgeny Kharlamov, Dmitriy Zheleznyakov
2011 Alberto Mendelzon Workshop on Foundations of Data Management  
Evolution of Knowledge Bases (KBs) expressed in Description Logics (DLs) proved its importance. Recent studies of evolution in DLs mostly focussed on model-based approaches.  ...  They showed that evolution of KBs in tractable DLs, such as DL-Lite, suffers from inexpressibility, i.e., the result of evolution cannot be captured in DL-Lite.  ...  Evolution of Knowledge Bases This section is based on [10] . Let K = (T , A) be a DL-Lite R KB and N a "new" ABox.  ... 
dblp:conf/amw/KharlamovZ11 fatcat:3ztbqffaufgtxm6uxy3xyt6s4u

Capturing Instance Level Ontology Evolution for DL-Lite [chapter]

Evgeny Kharlamov, Dmitriy Zheleznyakov
2011 Lecture Notes in Computer Science  
Evolution of Knowledge Bases (KBs) expressed in Description Logics (DLs) proved its importance.  ...  For KBs expressed in tractable DLs, such as DL-Lite, it was shown that the evolution suffers from inexpressibility, i.e., the result of evolution cannot be expressed in DL-Lite.  ...  Evolution of Knowledge Bases This section is based on [10] . Let K = (T , A) be a DL-Lite R KB and N a "new" ABox.  ... 
doi:10.1007/978-3-642-25073-6_21 fatcat:372g6ucdrbee5n52faxjqiqkaa

On Expansion and Contraction of DL-Lite Knowledge Bases [article]

Dmitriy Zheleznyakov, Evgeny Kharlamov, Werner Nutt, Diego Calvanese
2020 arXiv   pre-print
This leads to undesired properties of evolution results: evolution of DL-Lite KBs cannot be captured in DL-Lite.  ...  Thus, we propose a novel formula-based approach that respects our principles and for which evolution is expressible in DL-Lite.  ...  UNIBZ projects PARCIS and TaDaQua, and by the "European Region Tyrol-South Tyrol-Trentino" (EGTC) under the first call for basic research projects within the Euregio Interregional Project Network IPN12 "Knowledge-Aware  ... 
arXiv:2001.09365v1 fatcat:5mfrk3paqfc5dftarmm4jdd6ti

On Prototypes for Winslett's Semantics of DL-Lite ABox Evolution

Evgeny Kharlamov, Dmitriy Zheleznyakov
2011 International Workshop on Description Logics  
Evolution of Knowledge Bases expressed in Description Logics (DLs) proved its importance.  ...  It was understood that evolution under WS even in tractable DLs, such as DL-Lite, suffers from inexpressibility, i.e., the result of evolution cannot be expressed in the same logics.  ...  Part of this work was carried out while the first author was visiting Department of Computer Science of Oxford University.  ... 
dblp:conf/dlog/KharlamovZ11 fatcat:rhxqzwrbzrf4fpf3nbtkb5ip2y

Capturing model-based ontology evolution at the instance level: The case of DL-Lite

Evgeny Kharlamov, Dmitriy Zheleznyakov, Diego Calvanese
2013 Journal of computer and system sciences (Print)  
Evolution of Knowledge Bases (KBs) expressed in Description Logics (DLs) has gained a lot of attention lately.  ...  ., DL KBs [7,8]. Model-based evolution of KBs where both K and N are expressed in a language of the DL-Lite family [9] has recently received a lot of attention [8,10-13].  ...  ABox evolution of knowledge bases We now formally introduce the problem of ABox evolution of DL knowledge bases, concentrating on model-based approaches.  ... 
doi:10.1016/j.jcss.2013.01.006 fatcat:nvvafjostneofj67gskfwsh6nm

Tailoring Temporal Description Logics for Reasoning over Temporal Conceptual Models [chapter]

Alessandro Artale, Roman Kontchakov, Vladislav Ryzhikov, Michael Zakharyaschev
2011 Lecture Notes in Computer Science  
In particular, we consider temporal extensions of DL-Lite N bool , which was shown to be adequate for capturing non-temporal conceptual models without relationship inclusion, and its fragment DL-Lite N  ...  We propose here to temporalize the 'light-weight' DL-Lite logics obtaining nice computational results while still being able to represent various constraints of temporal conceptual models.  ...  Taken together, T and A constitute the DL-Lite N bool knowledge base (KB, for short) K = (T , A).  ... 
doi:10.1007/978-3-642-24364-6_1 fatcat:sgxj37qxijdg3hxwd6dgtby3fi

Dealing with Inconsistencies in DL-Lite Ontologies [chapter]

Liping Zhou
2009 Lecture Notes in Computer Science  
In our work, we consider inconsistency handling in the DL-Lite family, which is a family of DLs that preserve tractable reasoning and are specifically tailored to deal with large amounts of data.  ...  Like other DLs, inconsistencies in DL-Lite can also easily occur because disjoint axioms are allowed.  ...  Considering the novel property of DL-Lite that a DL-Lite knowledge base K = T , A is satisfiable iff db(A) is a model of cln(T ), A) [2] and a contradiction on a DL-Lite KB may hold only if a membership  ... 
doi:10.1007/978-3-642-02121-3_89 fatcat:p5zx6me7wvcfnc3t7juvfhahzm

On Instance-level Update and Erasure in Description Logic Ontologies

G. De Giacomo, M. Lenzerini, A. Poggi, R. Rosati
2008 Journal of Logic and Computation  
base in a DL L may not be expressible by ABoxes in L.  ...  Interestingly, DLs are typically not closed with respect to instance-level update and erasure, in the sense that the set of models corresponding to the application of any of these operations to a knowledge  ...  DLs knowledge bases.  ... 
doi:10.1093/logcom/exn051 fatcat:ghpy5p7mrrgd7gsd4rcscsyi3y

Instance-Driven Ontology Evolution in DL-Lite

Zhe Wang, Kewen Wang, Zhiqiang Zhuang, Guilin Qi
2015 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
In this paper we introduce a model-theoretic approach to such a contraction problem by using an alternative semantic characterisation of DL-Lite TBoxes.  ...  The development and maintenance of large and complex ontologies are often time-consuming and error-prone. Thus, automated ontology learning and evolution have attracted intensive research interest.  ...  A knowledge base (KB) K = T ∪ A consists of a TBox T and an ABox A. In this paper, an ontology is a DL-Lite TBox. B → A | ∃R C → B | ¬B | ⊥ R → P | P − where A ∈ N C and P ∈ N R .  ... 
doi:10.1609/aaai.v29i1.9413 fatcat:duujgkkhezhhxaxlczvzvnjqhe

Prioritized assertional-based removed sets revision of DL-Lite belief bases

Salem Benferhat, Zied Bouraoui, Odile Papini, Eric Würbel
2015 Annals of Mathematics and Artificial Intelligence  
Such strategy of revision is based on inconsistency minimization and consists in determining smallest subsets of axioms that should be dropped from the current DL-Lite knowledge base in order to restore  ...  This paper investigates the so-called "Removed Sets Revision" for revising DL-Lite knowledge bases when a new sure piece of information, called an input, is added.  ...  Related works In (Calvanese et al. 2010) , Calvanese et al. study the problem of knowledge base evolution in DL-Lite. Under the word evolution, they encompass both revision and update operations.  ... 
doi:10.1007/s10472-015-9494-2 fatcat:5wqexvbvvvajdmcla6wv2atzv4

An Argumentation-Based Approach for Computing Inconsistency Degree in Possibilistic Lightweight Ontologies

Khaoula Boutouhami, Ibrahim Hussein Musa
2019 Journal of Physics, Conference Series  
DL-Lite knowledge base) without going through the negative closure.  ...  In this paper, we are interested in using the argumentation for the inconsistency degree of uncertain knowledge bases expressed in possibilistic DL-Lite (the key notion in reasoning from a possibilistic  ...  Acknowledgments This work was supported by National Key R&D Program of China (2018YFC0830200) and National Natural Science Foundation of China Key Project (U1736204).  ... 
doi:10.1088/1742-6596/1229/1/012081 fatcat:isxorba77zh2leun5qephbb5tq

Past and Future of DL-Lite

Alessandro Artale, Roman Kontchakov, Vladislav Ryzhikov, Michael Zakharyaschev
2010 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
We show that, depending on the required types of temporal and atemporal constraints, the satisfiability problem for temporal knowledge bases in the resulting logics can be NLOGSPACE-, NP- and PSPACE-complete  ...  We design minimal temporal description logics that are capa- ble of expressing various aspects of temporal conceptual data models and investigate their computational complexity.  ...  Taken together, the TBox T and ABox A form the knowledge base (KB) K = (T , A) in L.  ... 
doi:10.1609/aaai.v24i1.7580 fatcat:qoj3u7ryofayvhcwrtcgqzyvae
« Previous Showing results 1 — 15 out of 1,946 results