BIROn - Birkbeck Institutional Research Online

    Query inseparability by games

    Botoeva, E. and Kontchakov, Roman and Ryzhikov, V. and Wolter, F. and Zakharyaschev, Michael (2014) Query inseparability by games. In: Bienvenu, M. and Ortiz, M. and Rosati, R. and Simkus, M. (eds.) Informal Proceedings of DL (Vienna, 17-20 July). CEUR Workshop Proceedings 1193. CEUR, pp. 83-95.

    [img]
    Preview
    Text
    DL2014-final.pdf - Author's Accepted Manuscript

    Download (349kB) | Preview

    Abstract

    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.

    Metadata

    Item Type: Book Section
    Additional Information: Informal Proceedings of the 27th International Workshop on Description Logics - Vienna, Austria, July 17-20, 2014. - Series ISSN: 1613-073
    School: Birkbeck Schools and Departments > School of Business, Economics & Informatics > Computer Science and Information Systems
    Depositing User: Roman Kontchakov
    Date Deposited: 11 Aug 2014 09:54
    Last Modified: 11 Oct 2016 12:02
    URI: http://eprints.bbk.ac.uk/id/eprint/10351

    Statistics

    Downloads
    Activity Overview
    107Downloads
    143Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item