On the Complexity of Horn and Krom Fragments of Second-Order Boolean Logic

Second-order Boolean logic is a generalization of QBF, whose constant alternation fragments are known to be complete for the levels of the exponential time hierarchy. We consider two types of restriction of this logic: 1) restrictions to term constructions, 2) restrictions to the form of the Boolean matrix. Of the first sort, we consider two kinds of restrictions: firstly, disallowing nested use of proper function variables, and secondly stipulating that each function variable must appear with a fixed sequence of arguments. Of the second sort, we consider Horn, Krom, and core fragments of the Boolean matrix. We classify the complexity of logics obtained by combining these two types of restrictions. We show that, in most cases, logics with k alternating blocks of function quantifiers are complete for the kth or (k-1)th level of the exponential time hierarchy. Furthermore, we establish NL-completeness for the Krom and core fragments, when k=1 and both restrictions of the first sort are in effect.

[1]  Christoph Scholl,et al.  Dependency Quantified Boolean Formulas: An Overview of Solution Methods and Applications - Extended Abstract , 2018, SAT.

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

[3]  Pekka Orponen,et al.  Complexity Classes of Alternating Machines with Oracles , 1983, ICALP.

[4]  Hans Kleine Büning,et al.  Dependency Quantified Horn Formulas: Models and Complexity , 2006, SAT.

[5]  J. Reif,et al.  Lower bounds for multiplayer noncooperative games of incomplete information , 2001 .

[6]  Neil Immerman,et al.  Sparse sets in NP-P: Exptime versus nexptime , 1983, STOC.

[7]  Salil P. Vadhan,et al.  Computational Complexity , 2005, Encyclopedia of Cryptography and Security.

[8]  Sanjeev Arora,et al.  Computational Complexity: A Modern Approach , 2009 .

[9]  Robert E. Tarjan,et al.  A Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas , 1979, Inf. Process. Lett..

[10]  Albert R. Meyer,et al.  Word problems requiring exponential time(Preliminary Report) , 1973, STOC.

[11]  Martin Lück,et al.  Complete Problems of Propositional Logic for the Exponential Hierarchy , 2016, ArXiv.

[12]  John H. Reif,et al.  Multiple-person alternation , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[13]  Klaus W. Wagner,et al.  The Analytic Polynomial‐Time Hierarchy , 1998, Math. Log. Q..

[14]  Jonni Virtema,et al.  On Quantified Propositional Logics and the Exponential Time Hierarchy , 2016, GandALF.

[15]  Markus Lohrey,et al.  Model-checking hierarchical structures , 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).

[16]  Martina Seidl,et al.  A Survey on Applications of Quantified Boolean Formulas , 2019, 2019 IEEE 31st International Conference on Tools with Artificial Intelligence (ICTAI).