Block-Sorted Quantified Conjunctive Queries
We study the complexity of model checking in quantified conjunctive logic, that is, the fragment of first-order logic where both quantifiers may be used, but conjunction is the only permitted connective. In particular, we study block-sorted queries, which we define to be prenex sentences in multi-sorted relational first-order logic where two variables having the same sort must appear in the same quantifier block. We establish a complexity classification theorem that describes precisely the sets of block-sorted queries of bounded arity on which model checking is fixed-parameter tractable. This theorem strictly generalizes, for the first time, the corresponding classification for existential conjunctive logic (which is known and due to Grohe) to a logic in which both quantifiers are present.
Unable to display preview. Download preview PDF.
- 1.Chandra, A.K., Merlin, P.M.: Optimal implementation of conjunctive queries in relational data bases. In: Proceddings of STOC 1977, pp. 77–90 (1977)Google Scholar
- 2.Chen, H., Dalmau, V.: Decomposing quantified conjunctive (or disjunctive) formulas. In: LICS (2012)Google Scholar
- 4.Chen, H., Madelaine, F., Martin, B.: Quantified constraints and containment problems. In: Twenty-Third Annual IEEE Symposium on Logic in Computer Science, LICS (2008)Google Scholar
- 5.Gottlob, G., Greco, G., Scarcello, F.: The complexity of quantified constraint satisfaction problems under structural restrictions. In: IJCAI 2005 (2005)Google Scholar
- 6.Grohe, M.: The complexity of homomorphism and constraint satisfaction problems seen from the other side. Journal of the ACM 54(1) (2007)Google Scholar
- 7.Grohe, M., Schwentick, T., Segoufin, L.: When is the evaluation of conjunctive queries tractable? In: STOC 2001 (2001)Google Scholar
- 8.Marx, D.: Tractable hypergraph properties for constraint satisfaction and conjunctive queries. In: Proceedings of the 42nd ACM Symposium on Theory of Computing, pp. 735–744 (2010)Google Scholar