Lower bounds on the complexity of MSO1 model-checking

Kreutzer and Tazari proved in 2010 that MSO"2 model-checking is not polynomial (XP) w.r.t. the formula size as parameter for graph classes that are subgraph-closed and whose tree-width is poly-logarithmically unbounded. We prove that MSO"1 model-checking with a fixed set of vertex labels - i.e., without edge-set quantification - is not solvable even in quasi-polynomial time for fixed MSO"1-formulas in such graph classes. Both the lower bounds hold modulo a certain complexity-theoretic assumption, namely, the Exponential-Time Hypothesis (ETH) in the former case and the non-uniform ETH in the latter case. In comparison to Kreutzer and Tazari, we show a different set of problems to be intractable, and our stronger complexity assumption of non-uniform ETH slightly weakens assumptions on the graph class and greatly simplifies important lengthy parts of the former proof. Our result also has an interesting consequence in the realm of digraph width measures.

[1]  Petr Hliněný,et al.  Are There Any Good Digraph Width Measures? , 2010, IPEC.

[2]  Stephan Kreutzer,et al.  On the Parameterised Intractability of Monadic Second-Order Logic , 2009, CSL.

[3]  Bruno Courcelle,et al.  Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width , 2000, Theory of Computing Systems.

[4]  Venkat Chandrasekaran,et al.  Complexity of Inference in Graphical Models , 2008, UAI.

[5]  Celia Wrathall,et al.  Complete Sets and the Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..

[6]  P. Dangerfield.  Logic , 1996, Aristotle and the Stoics.

[7]  Bruce A. Reed,et al.  Polynomial treewidth forces a large grid-like-minor , 2008, Eur. J. Comb..

[8]  Robert Ganian,et al.  Are there any good digraph width measures? , 2016, J. Comb. Theory, Ser. B.

[9]  Bruno Courcelle,et al.  Graph Structure and Monadic Second-Order Logic - A Language-Theoretic Approach , 2012, Encyclopedia of mathematics and its applications.

[10]  Daniel W. Cranston.  Strong edge-coloring of graphs with maximum degree 4 using 22 colors , 2006, Discret. Math..

[11]  Larry J. Stockmeyer,et al.  The Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..

[12]  Lance Fortnow,et al.  Robust Simulations and Significant Separations , 2011, ICALP.

[13]  Johann A. Makowsky,et al.  Tree-width and the monadic quantifier hierarchy , 2003, Theor. Comput. Sci..

[14]  Bruno Courcelle,et al.  The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs , 1990, Inf. Comput..

[15]  Y. Gurevich.  On Finite Model Theory , 1990 .

[16]  Stephan Kreutzer,et al.  On brambles, grid-like minors, and parameterized intractability of monadic second-order logic , 2010, SODA '10.

[17]  Jörg Flum,et al.  Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series) , 2006 .

[18]  Russell Impagliazzo,et al.  Which problems have strongly exponential complexity? , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[19]  Stephan Kreutzer,et al.  Lower Bounds for the Complexity of Monadic Second-Order Logic , 2010, 2010 25th Annual IEEE Symposium on Logic in Computer Science.

[20]  Thomas Wilke,et al.  Logic and automata : history and perspectives , 2007 .

[21]  Petr A. Golovach,et al.  Clique-width: on the price of generality , 2009, SODA.

[22]  Petr A. Golovach,et al.  Algorithmic lower bounds for problems parameterized by clique-width , 2010, SODA '10.

[23]  Lance Fortnow,et al.  Uniformly hard languages , 1998, Proceedings. Thirteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat. No.98CB36247).

[24]  Martin Grohe,et al.  Logic, graphs, and algorithms , 2007, Logic and Automata.

[25]  Jörg Flum,et al.  Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.

[26]  Martin Grohe,et al.  Algorithmic Meta Theorems , 2008, WG.