Cited By
View all- Chen HSuciu DSkritek SKoch C(2019)The Selfish Models PropertyProceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/3294052.3319682(383-398)Online publication date: 25-Jun-2019
The Tractability Frontier of Graph-Like First-Order Query Sets
Author: 
Hubie ChenAuthors Info & Claims
Hubie ChenAuthors Info & ClaimsArticle No.: 26, Pages 1 - 29
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.
References
[1]
Isolde Adler and Mark Weyer. 2012. Tree-width for first order formulae. Logical Methods in Computer Science 8, 1, Article No. 32.
[2]
Hans L. Bodlaender. 1998. A partial k-arboretum of graphs with bounded treewidth. Theoretical Computer Science 209, 1--45.
[3]
Simone Bova and Hubie Chen. 2014. The complexity of width minimization for existential positive queries. In Proceedings of the 17th International Conference on Database Theory (ICDT’14). 235--244.
[4]
Hubie Chen. 2014. On the complexity of existential positive queries. ACM Transactions on Computational Logic 151, Article No. 9.
[5]
Hubie Chen and Víctor Dalmau. 2012. Decomposing quantified conjunctive (or disjunctive) formulas. In Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science (LICS’12). 205--214.
[6]
Hubie Chen and Martin Grohe. 2010. Constraint satisfaction with succinctly specified relations. Journal of Computer and System Sciences 768, 847--860.
[7]
Hubie Chen and Díniel Marx. 2013. Block-sorted quantified conjunctive queries. In Proceedings of the 40th International Conference on Automata, Languages, and Programming—Volume Part II (ICALP’13). 125--136.
[8]
Hubie Chen and Stefan Mengel. 2015. A trichotomy in the complexity of counting answers to conjunctive queries. In Proceedings of the 18th International Conference on Database Theory (ICDT’15). 110--126.
[9]
Hubie Chen and Stefan Mengel. 2016. Counting answers to existential positive queries: A complexity classification. In Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems. 315--326.
[10]
Hubie Chen and Moritz Müller. 2013. The fine classification of conjunctive queries and parameterized logarithmic space complexity. In Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (PODS’13). 309--320.
[11]
Hubie Chen and Moritz Müller. 2014. One hierarchy spawns another: Graph deconstructions and the complexity classification of conjunctive queries. In Proceedings of the Joint Meeting of the 23rd EACSL Annual Conference on Computer Science Logic and the 29th Annual ACM/IEEE Symposium on Logic in Computer Science (CSL-LICS’14). 32:1--32:10.
[12]
Hubie Chen and Moritz Müller. 2015. The fine classification of conjunctive queries and parameterized logarithmic space. Transactions on Computation Theory 72, Article No. 7.
[13]
Yijia Chen, Marc Thurley, and Mark Weyer. 2008. Understanding the complexity of induced subgraph isomorphisms. In Proceedings of the 35th International Colloquium on Automata, Languages, and Programming—Volume Part I (ICALP’08). 587--596.
[14]
Radu Curticapean and Díniel Marx. 2014. Complexity of counting subgraphs: Only the boundedness of the vertex-cover number counts. In Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science (FOCS’14). 130--139.
[15]
A. Durand and S. Mengel. 2013. Structural tractability of counting of solutions to conjunctive queries. In Proceedings of the 16th International Conference on Database Theory (ICDT’13).
[16]
J. Flum and M. Grohe. 2006. Parameterized Complexity Theory. Springer.
[17]
Martin Grohe. 2007. The complexity of homomorphism and constraint satisfaction problems seen from the other side. Journal of the ACM 541, Article No. 1.
[18]
Martin Grohe, Thomas Schwentick, and Luc Segoufin. 2001. When is the evaluation of conjunctive queries tractable? In Proceedings of the 23rd Annual ACM Symposium on Theory of Computing (STOC’01). 657--666.
[19]
Peter Jonsson, Victor Lagerkvist, and Gustav Nordh. 2013. Blowing holes in various aspects of computational problems, with applications to constraint satisfaction. In Proceedings of the International Conference on Principles and Practice of Constraint Programming (CP’13). 398--414.
[20]
P. Kolaitis and M. Vardi. 2000. Conjunctive-query containment and constraint satisfaction. Journal of Computer and System Sciences 61, 302--332.
[21]
C. Papadimitriou and M. Yannakakis. 1999. On the complexity of database queries. Journal of Computer and System Sciences 583, 407--427.
[22]
Nicole Schweikardt, Thomas Schwentick, and Luc Segoufin. 2009. Database theory: Query languages. In Algorithms and Theory of Computation Handbook (2 ed.), M. J. Atallah and M. Blanton (Eds.). Vol. 2: Special Topics and Techniques. CRC Press, Boca Raton, FL, 19.
[23]
Moshe Y. Vardi. 1995. On the complexity of bounded-variable queries. In Proceedings of the 14th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS’95). 266--276.
Index Terms
- The Tractability Frontier of Graph-Like First-Order Query Sets
Recommendations
The tractability frontier of graph-like first-order query sets
CSL-LICS '14: Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)We study 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 ...
Fixed-Parameter Tractability, Definability, and Model-Checking
In this article, we study parameterized complexity theory from the perspective of logic, or more specifically, descriptive complexity theory.
We propose to consider parameterized model-checking problems for various fragments of first-order logic as ...
Fixed-Parameter Tractability and Completeness I: Basic Results
For many fixed-parameter problems that are trivially soluable in polynomial-time, such as ($k$-)DOMINATING SET, essentially no better algorithm is presently known than the one which tries all possible solutions. Other problems, such as ($k$-)...
Comments
Information & Contributors
Information
Published In
August 2017
197 pages
Copyright © 2017 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 17 August 2017
Accepted: 01 March 2017
Revised: 01 February 2017
Received: 01 March 2015
Published in JACM Volume 64, Issue 4
Check for updates
Author Tags
Qualifiers
- Research-article
- Research
- Refereed
Funding Sources
- Basque Government Project S-PE12UN050
- University of the Basque Country
- Spanish Project FORMALISM
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 186Total Downloads
- Downloads (Last 12 months)5
- Downloads (Last 6 weeks)0
Reflects downloads up to 09 Nov 2024
Other Metrics
Citations
Cited By
View all- Chen HSuciu DSkritek SKoch C(2019)The Selfish Models PropertyProceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/3294052.3319682(383-398)Online publication date: 25-Jun-2019
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in