We investigate conjunctive query inseparability of description logic knowledge bases (KBs) with respect to a given signature, a fundamental problem for KB versioning, module extraction, forgetting and knowledge exchange. We develop a game-theoretic technique for checking query inseparability of KBs expressed in fragments of Horn-ALCHI, and show a number of complexity results ranging from P to ExpTime and 2ExpTime. We also employ our results to resolve two major open problems for OWL 2 QL by showing that TBox query inseparability and the membership problem for universal UCQ-solutions in knowledge exchange are both ExpTime-complete for combined complexity

Botoeva, E.

Kontchakov, Roman

Ryzhikov, Vladislav

Wolter, F.

Zakharyaschev, Michael

English

Ryzhikov, V.

Name not available

Query inseparability by games

Birkbeck Institutional Research Online

(eds.): Modular Ontologies: Concepts, Theories and Techniques for Knowledge Modularization,

Complexities of Horn description logics.

Conjunctive query answering in the description logic EL usingarelationaldatabasesystem.In:Proc.ofthe21stInt.JointConf.onArtiﬁcialIntelligence (IJCAI-09).

Conjunctive query inseparability of OWL 2 QL TBoxes. In:

Consequence-driven reasoning for Horn-SHIQ ontologies. In:

Data complexity of reasoning in very expressive description logics. In:

Deciding inseparability and conservative extensions in the description logic EL.

Exchanging description logic knowledge bases. In:

Exchanging OWL 2 QL knowledge bases. In:

Forget it! In:

Inﬁnite games.

J.P.: Principles of Model Checking.

Pushing the EL envelope. In:

Query answering in the description logic HornSHIQ. In:

Query inseparability for description logic knowledge bases. In:

Supporting concurrent ontology development: Framework, algorithms and tool.

The combined approach to query answering in DL-Lite. In:

The Description Logic Handbook: Theory, Implementation and Applications.

Tractable reasoning and efﬁcient query answering in description logics: The DL-Lite family.

We investigate conjunctive query inseparability of description logic knowledge bases (KBs) with respect to a given signature, a fundamental problem for KB versioning, module extraction, forgetting and knowledge exchange. We develop a game-theoretic technique for checking query inseparability of KBs expressed in fragments of Horn-ALCHI, and show a number of complexity results ranging from P to EXPTIME and 2EXPTIME. We also employ our results to resolve two major open problems for OWL 2 QL by showing that TBox query inseparability and the membership problem for universal UCQ-solutions in knowledge exchange are both EXPTIME complete for combined complexit

Botoeva, Elena

Wolter, Frank

Kent Academic Repository

Query Inseparability by Games

Abstract. We investigate conjunctive query inseparability of description logic knowledge bases (KBs) with respect to a given signature, a fundamental prob-lem for KB versioning, module extraction, forgetting and knowledge exchange. We develop a game-theoretic technique for checking query inseparability of KBs expressed in fragments of Horn-ALCHI, and show a number of complexity re-sults ranging from P to EXPTIME and 2EXPTIME. We also employ our results to resolve two major open problems for OWL2QL by showing that TBox query in-separability and the membership problem for universal UCQ-solutions in knowl-edge exchange are both EXPTIME-complete for combined complexity

Query inseparability by games

Abstract

Similar works

Full text

Available Versions

Name not available

Birkbeck Institutional Research Online

Kent Academic Repository

CiteSeerX