BIROn - Birkbeck Institutional Research Online

    Query-based entailment and inseparability for ALC ontologies

    Botoeva, E. and Lutz, C. and Ryzhikov, V. and Wolter, F. and Zakharyaschev, Michael (2016) Query-based entailment and inseparability for ALC ontologies. In: UNSPECIFIED (ed.) The 25th International Joint Conference on Artificial Intelligence IJCAI-16. Palo Alto, U.S.: AAAI Press / International Joint Conferences on Artificial Intelligence, pp. 1001-1007. ISBN 9781577357704.

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

    Download (372kB) | Preview

    Abstract

    We investigate the problem whether two ALC knowledge bases are indistinguishable by queries over a given vocabulary. We give model-theoretic criteria and prove that this problem is undecid- able for conjunctive queries (CQs) but decidable in 2EXPTIME for unions of rooted CQs. We also consider the problem whether two ALC TBoxes give the same answers to any query in a given vocabulary over all ABoxes, and show that for CQs this problem is undecidable, too, but becomes decidable and 2EXPTIME-complete in Horn-ALC, and even EXPTIME-complete in Horn-ALC when restricted to (unions of) rooted CQs.

    Metadata

    Item Type: Book Section
    School: Birkbeck Schools and Departments > School of Business, Economics & Informatics > Computer Science and Information Systems
    Depositing User: Michael Zakharyaschev
    Date Deposited: 25 Aug 2016 14:37
    Last Modified: 02 Jun 2017 08:07
    URI: http://eprints.bbk.ac.uk/id/eprint/15362

    Statistics

    Downloads
    Activity Overview
    174Downloads
    103Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item