BIROn - Birkbeck Institutional Research Online

    Conjunctive queries with negation over DL-Lite: a closer look

    Gutiérrez-Basulto, V. and Ibáñez-García, Y. and Kontchakov, Roman and Kostylev, E. (2013) Conjunctive queries with negation over DL-Lite: a closer look. In: Faber, W. and Lembo, D. (eds.) Web Reasoning and Rule Systems. LNCS 7994. Berlin, Germany: Springer, pp. 109-122. ISBN 9783642396656.

    [img]
    Preview
    Text
    RR-2013.pdf - Author's Accepted Manuscript

    Download (308kB) | Preview

    Abstract

    While conjunctive query (CQ) answering over DL-Lite has been studied extensively, there have been few attempts to analyse CQs with negated atoms. This paper deepens the study of the problem. Answering CQs with safe negation and CQs with a single inequality over DL-Lite with role inclusions is shown to be undecidable, even for a fixed TBox and query.Without role inclusions, answering CQs with one inequality is P-hard and with two inequalities CoNP-hard in data complexity.

    Metadata

    Item Type: Book Section
    Additional Information: 7th International Conference, RR 2013, Mannheim, Germany, July 27-29, 2013. Proceedings
    School: Birkbeck Schools and Departments > School of Business, Economics & Informatics > Computer Science and Information Systems
    Depositing User: Roman Kontchakov
    Date Deposited: 11 Aug 2014 11:42
    Last Modified: 28 Jul 2019 13:33
    URI: http://eprints.bbk.ac.uk/id/eprint/10328

    Statistics

    Downloads
    Activity Overview
    181Downloads
    148Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item