Logic-based ontology comparison and module extraction, with an application to DL-Lite

We develop a formal framework for comparing different versions of ontologies, and apply it to ontologies formulated in terms of DL-Lite, a family of ‘lightweight’ description logics designed for data-intensive applications. The main feature of our approach is that we take into account the vocabulary...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Artificial intelligence Ročník 174; číslo 15; s. 1093 - 1141
Hlavní autoři: Kontchakov, Roman, Wolter, Frank, Zakharyaschev, Michael
Médium: Journal Article
Jazyk:angličtina
Vydáno: Oxford Elsevier B.V 01.10.2010
Elsevier
Témata:
Algorithmics. Computability. Computer arithmetics
Algorithms
Applied sciences
Computational complexity
Computer science; control theory; systems
Description logic
Encoding
Entailment
Exact sciences and technology
Extraction
Forgetting
Inclusions
Information systems. Data bases
Language theory and syntactical analysis
Logic
Logical, boolean and switching functions
Mathematical logic
Memory organisation. Data processing
Module extraction
Modules
Ontology
Signatures
Software
Solvers
Theoretical computing
Uniform interpolation
Forgetting
Module extraction
Description logic
Ontology
Uniform interpolation
Computational complexity
Entailment
High performance
Vocabulary
Formal method
Language theory
Locality
Knowledge representation
Very large databases
Syntactic analysis
Logic design
Logical programming
Maintenance
Distributed computing
Semantic web
Mathematical logic
Computational linguistics
Satisfiability
ISSN:0004-3702, 1872-7921
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We develop a formal framework for comparing different versions of ontologies, and apply it to ontologies formulated in terms of DL-Lite, a family of ‘lightweight’ description logics designed for data-intensive applications. The main feature of our approach is that we take into account the vocabulary (=signature) with respect to which one wants to compare ontologies. Five variants of difference and inseparability relations between ontologies are introduced and their respective applications for ontology development and maintenance discussed. These variants are obtained by generalising the notion of conservative extension from mathematical logic and by distinguishing between differences that can be observed among concept inclusions, answers to queries over ABoxes, by taking into account additional context ontologies, and by considering a model-theoretic, language-independent notion of difference. We compare these variants, study their meta-properties, determine the computational complexity of the corresponding reasoning tasks, and present decision algorithms. Moreover, we show that checking inseparability can be automated by means of encoding into QBF satisfiability and using off-the-shelf general purpose QBF solvers. Inseparability relations between ontologies are then used to develop a formal framework for (minimal) module extraction. We demonstrate that different types of minimal modules induced by these inseparability relations can be automatically extracted from real-world medium-size DL-Lite ontologies by composing the known tractable syntactic locality-based module extraction algorithm with our non-tractable extraction algorithms and using the multi-engine QBF solver aqme. Finally, we explore the relationship between uniform interpolation (or forgetting) and inseparability.
Bibliografie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0004-3702
1872-7921
DOI:10.1016/j.artint.2010.06.003