Minimal module extraction from DL-lite ontologies using QBF solvers

Authors:
R. Kontchakov;L. Pulina;U. Sattler;T. Schneider;P. Selmer;F. Wolter;M. Zakharyaschev
Affiliations:
School of Computer Science and Information Systems, Birkbeck College London;Dipartimento di Informatica Sistemistica e Telematica, University of Genoa;School of Computer Science, University of Manchester;School of Computer Science, University of Manchester;School of Computer Science and Information Systems, Birkbeck College London;Department of Computer Science, University of Liverpool;School of Computer Science and Information Systems, Birkbeck College London
Venue:
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Year:
2009

Citing 10
Cited 12

Web ontology segmentation: analysis, classification and use

Proceedings of the 15th international conference on World Wide Web
A self-adaptive multi-engine solver for quantified Boolean formulas

Constraints
Semantic Modularity and Module Extraction in Description Logics

Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
DL-Lite: tractable description logics for ontologies

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
DL-lite in the light of first-order logic

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Clause/term resolution and learning in the evaluation of quantified Boolean formulas

Journal of Artificial Intelligence Research
Modular reuse of ontologies: theory and practice

Journal of Artificial Intelligence Research
Reasoning over extended ER models

ER'07 Proceedings of the 26th international conference on Conceptual modeling
sKizzo: a suite to evaluate and certify QBFs

CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Binary clause reasoning in QBF

SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing

The DL-lite family and relations

Journal of Artificial Intelligence Research
Engineering portfolios of Machine Learning algorithms to solve complex tasks in Robotics and Automated Reasoning

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

Artificial Intelligence
Forgetting for knowledge bases in DL-Lite

Annals of Mathematics and Artificial Intelligence
vSPARQL: A view definition language for the semantic web

Journal of Biomedical Informatics
The seventh QBF solvers evaluation (QBFEVAL’10)

SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
A uniform approach for generating proofs and strategies for both true and false QBF formulas

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
The modular structure of an ontology: atomic decomposition

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
The logical difference for the lightweight description logic EL

Journal of Artificial Intelligence Research
Reasoning over ontologies with hidden content: the import-by-query approach

Journal of Artificial Intelligence Research
Model-theoretic inseparability and modularity of description logic ontologies

Artificial Intelligence
Ontology-based data access: An application to intermodal logistics

Information Systems Frontiers

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a formal framework for (minimal) module extraction based on an abstract notion of inseparability w.r.t. a signature between ontologies. Two instances of this framework are discussed in detail for DL-Lite ontologies: concept inseparability, when ontologies imply the same complex concept inclusions over the signature, and query inseparability, when they give the same answers to existential queries for any instance data over the signature. We demonstrate that different types of corresponding minimal modules for these inseparability relations can be automatically extracted from large-scale DL-Lite ontologies by composing the tractable syntactic locality-based module extraction algorithm with intractable extraction algorithms using the multi-engine QBF solver AQME. The extracted minimal modules are compared with those obtained using non-logic-based approaches.