BIROn - Birkbeck Institutional Research Online

    On expressibility of non-monotone operators in SPARQL

    Kontchakov, Roman and Kostylev, E. (2016) On expressibility of non-monotone operators in SPARQL. In: UNSPECIFIED (ed.) Fifteenth International Conference on the Principles of Knowledge Representation and Reasoning. AAAI, pp. 369-379.

    [img]
    Preview
    Text
    KR_SPARQL_CR.pdf - Updated Version

    Download (305kB) | Preview

    Abstract

    SPARQL, a query language for RDF graphs, is one of the key technologies for the Semantic Web. The expressivity and complexity of various fragments of SPARQL have been studied extensively. It is usually assumed that the optional matching operator OPTIONAL has only two graph patterns as arguments. The specification of SPARQL, however, defines it as a ternary operator, with an additional filter condition. We address the problem of expressibility of the full ternary OPTIONAL via the simplified binary version and show that it is possible, but only with an exponential blowup in the size of the query (under common complexity-theoretic assumptions). We also study expressibility of other non-monotone SPARQL operators via optional matching and each other.

    Metadata

    Item Type: Book Section
    Additional Information: Cape Town International Convention Centre, April 25, 2016 – April 29, 2016
    Keyword(s) / Subject(s): SPARQL, optional graph pattern matching, expressibility, complexity, non-monotone operator
    School: Birkbeck Schools and Departments > School of Business, Economics & Informatics > Computer Science and Information Systems
    Depositing User: Roman Kontchakov
    Date Deposited: 29 Apr 2016 14:01
    Last Modified: 01 Aug 2019 16:46
    URI: http://eprints.bbk.ac.uk/id/eprint/15026

    Statistics

    Downloads
    Activity Overview
    92Downloads
    173Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item