BIROn - Birkbeck Institutional Research Online

    The Tractability Frontier of Graph-Like First-Order Query Sets

    Chen, Hubie (2017) The Tractability Frontier of Graph-Like First-Order Query Sets. Journal of the ACM 64 (4), pp. 1-29. ISSN 000-45411.

    Full text not available from this repository.

    Abstract

    The focus of this work is first-order model checking, by which we refer to the problem of deciding whether or not a given first-order sentence is satisfied by a given finite structure. In particular, we aim to understand on which sets of sentences this problem is tractable, in the sense of parameterized complexity theory. To this end, we define the notion of a graph-like sentence set; the definition is inspired by previous work on first-order model checking wherein the permitted connectives and quantifiers were restricted. Our main theorem is the complete tractability classification of such graph-like sentence sets, which is (to our knowledge) the first complexity classification theorem concerning a class of sentences that has no restriction on the connectives and quantifiers. To present and prove our classification, we introduce and develop a novel complexity-theoretic framework that is built on parameterized complexity and includes new notions of reduction.

    Metadata

    Item Type: Article
    School: School of Business, Economics & Informatics > Computer Science and Information Systems
    Depositing User: Administrator
    Date Deposited: 04 Feb 2020 15:08
    Last Modified: 04 Feb 2020 15:08
    URI: https://eprints.bbk.ac.uk/id/eprint/30798

    Statistics

    Downloads
    Activity Overview
    0Downloads
    45Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item