论文信息 - The Complexity of Model Checking for Boolean Formulas

The Complexity of Model Checking for Boolean Formulas

We examine the complexity of the model checking problem for Boolean formulas, which is the following decision problem: Given a Boolean formula without variables, does it evaluate to true? We show that the complexity of this problem is determined by certain closure properties of the connectives allowed to build the formula, and achieve a complete classification: The formula model checking problem is either complete for NC1, equivalent to counting modulo 2, or complete for a level of the logarithmic time hierarchy under very strict reductions.

Henning Schnoor

[1] Heribert Vollmer,et al. Gap-Languages and Log-Time Complexity Classes , 1997, Theor. Comput. Sci..

[2] Heribert Vollmer,et al. The Complexity of Generalized Satisfiability for Linear Temporal Logic , 2006, Electron. Colloquium Comput. Complex..

[3] Lane A. Hemaspaandra. SIGACT news complexity theory column 42 , 2003, SIGA.

[4] Harry R. Lewis,et al. Satisfiability problems for propositional calculi , 1979, Mathematical systems theory.

[5] Pierre McKenzie,et al. Circuits, Matrices, and Nonassociative Computation , 1995, J. Comput. Syst. Sci..

[6] Richard E. Ladner,et al. On the Structure of Polynomial Time Reducibility , 1975, JACM.

[7] Henning Schnoor,et al. The Complexity of the Descriptiveness of Boolean Circuits over Different Sets of Gates , 2006, Theory of Computing Systems.