论文信息 - Boolean Functions as Models for Quantified Boolean Formulas

Boolean Functions as Models for Quantified Boolean Formulas

In this paper, we introduce the notion of models for quantified Boolean formulas. For various classes of quantified Boolean formulas and various classes of Boolean functions, we investigate the problem of determining whether a model exists. Furthermore, we show for these classes the complexity of the model checking problem, which is to check whether a given set of Boolean functions is a model for a formula. For classes of Boolean functions, we establish some characterizations in terms of classes of quantified Boolean formulas that have such a model.

[1] Hans Kleine Büning,et al. On Boolean Models for Quantified Boolean Horn Formulas , 2003, SAT.

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

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

[4] Hans Kleine Büning,et al. Resolution for Quantified Boolean Formulas , 1995, Inf. Comput..

[5] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[6] Burkhard Monien,et al. A Distributed Algorithm to Evaluate Quantified Boolean Formulae , 2000, AAAI/IAAI.

[7] Reinhold Letz,et al. Lemma and Model Caching in Decision Procedures for Quantified Boolean Formulas , 2002, TABLEAUX.

[8] Armin Haken,et al. The Intractability of Resolution , 1985, Theor. Comput. Sci..

[9] Armando Tacchella,et al. QUBE: A System for Deciding Quantified Boolean Formulas Satisfiability , 2001, IJCAR.

[10] Jussi Rintanen,et al. Improvements to the Evaluation of Quantified Boolean Formulae , 1999, IJCAI.

[11] Hans K. Buning,et al. Propositional Logic: Deduction and Algorithms , 1999 .

[12] Marco Schaerf,et al. An Algorithm to Evaluate Quantified Boolean Formulae and Its Experimental Evaluation , 2002, Journal of Automated Reasoning.