Chen, Hubie and Dalmau, V. (2016) Decomposing quantified conjunctive (or disjunctive) formulas. SIAM Journal on Computing 45 (6), pp. 2066-2086. ISSN 0097-5397.
|
Text
paper.pdf - Author's Accepted Manuscript Download (284kB) | Preview |
Abstract
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.
Metadata
| Item Type: | Article |
|---|---|
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Hubie Chen |
| Date Deposited: | 20 Apr 2018 13:16 |
| Last Modified: | 13 Jun 2025 10:45 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/22144 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
