On the complexity of bounded-variable queries (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A partial k-arboretum of graphs with bounded treewidth
Theoretical Computer Science
Conjunctive-query containment and constraint satisfaction
Journal of Computer and System Sciences - Special issue on the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems
When is the evaluation of conjunctive queries tractable?
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Query evaluation via tree-decompositions
Journal of the ACM (JACM)
Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width
Journal of Computer and System Sciences - Special issu on PODS 2001
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Fixed-Parameter Hierarchies inside PSPACE
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
The complexity of homomorphism and constraint satisfaction problems seen from the other side
Journal of the ACM (JACM)
Hypertree width and related hypergraph invariants
European Journal of Combinatorics
Non-dichotomies in Constraint Satisfaction Complexity
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Treewidth: A Useful Marker of Empirical Hardness in Quantified Boolean Logic Encodings
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Collapsibility and consistency in quantified constraint satisfaction
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
The complexity of quantified constraint satisfaction problems under structural restrictions
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Tractable hypergraph properties for constraint satisfaction and conjunctive queries
Proceedings of the forty-second ACM symposium on Theory of computing
Tree-width for first order formulae
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Constraint satisfaction with succinctly specified relations
Journal of Computer and System Sciences
Complexity of K-tree structured constraint satisfaction problems
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1
Tractable Structures for Constraint Satisfaction with Truth Tables
Theory of Computing Systems
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Structural tractability of counting of solutions to conjunctive queries
Proceedings of the 16th International Conference on Database Theory
Block-Sorted quantified conjunctive queries
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
The complexity of weighted counting for acyclic conjunctive queries
Journal of Computer and System Sciences
On the complexity of existential positive queries
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
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.