BIROn - Birkbeck Institutional Research Online

    Decomposing quantified conjunctive (or disjunctive) formulas

    Chen, Hubie and Dalmau, V. (2016) Decomposing quantified conjunctive (or disjunctive) formulas. SIAM Journal on Computing 45 (6), pp. 2066-2086. ISSN 0097-5397.

    paper.pdf - Author's Accepted Manuscript

    Download (284kB) | Preview


    Model checking---deciding if a logical sentence holds on a structure---is a basic computational task that is well known to be intractable in general. For first-order logic on finite structures, it is PSPACE-complete, and the natural evaluation algorithm exhibits exponential dependence on the formula. We study model checking on the quantified conjunctive fragment of first-order logic, namely, prenex sentences having a purely conjunctive quantifier-free part. Following a number of works, we associate a graph to the quantifier-free part; each sentence then induces a prefixed graph, a quantifier prefix paired with a graph on its variables. We give a comprehensive classification of the sets of prefixed graphs on which model checking is tractable based on a novel generalization of treewidth that generalizes and places into a unified framework a number of existing results.


    Item Type: Article
    School: Birkbeck Schools and Departments > School of Business, Economics & Informatics > Computer Science and Information Systems
    Depositing User: Hubert Chen
    Date Deposited: 20 Apr 2018 13:16
    Last Modified: 04 Feb 2020 15:02


    Activity Overview

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item