Abstract
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. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Büning, H. K., & Zhao, X. (2006). Minimal false quantified Boolean formulas. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4121 LNCS, pp. 339–352). Springer Verlag. https://doi.org/10.1007/11814948_32
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
