Minimal False Quantified Boolean Formulas
This paper is concerned with the minimal falsity problem MF for quantified Boolean formulas. A QCNF formula (i.e., with CNF-matrix) is called minimal false, if the formula is false and any proper subformula is true. It is shown that the minimal falsity problem is PSPACE-complete. Then the deficiency of a QCNF formula is defined as the difference between the number of clauses and the number of existentially quantified variables. For quantified Boolean formulas with deficiency one, MF is solvable in polynomial time.
KeywordsPolynomial Time Induction Hypothesis Truth Assignment Boolean Formula Propositional Formula
Unable to display preview. Download preview PDF.
- 3.Ding, D., Kleine Büning, H., Zhao, X.: Minimal Falsity for QBF with Fixed Deficiency. In: Proceedings of the Workshop on Theory and Applications of Quantified Boolean Formulas, IJCAR 2001, Siena, pp. 21–28 (2001)Google Scholar
- 8.Kullmann, O.: An Application of Matroid Theory to the ASAT Problem, Electronic Colloquium on Computational Complexity, Report 18 (2000)Google Scholar