Subclasses of quantified boolean formulas
Using the results of a former paper of two of the authors [KaKB 90], for certain subclasses of quantified Boolean formulas it is shown, that the evaluation problems for these classes are coNP-complete. These subclasses can be seen as extensions of Horn and 2-CNF formulas.
Further it is shown that the evaluation problem for quantified CNF formulas remains PSPACE-complete, even if at most one universal variable is allowed in each clause.
KeywordsEvaluation Problem Boolean Formula Propositional Formula Unit Clause Universal Variable
Unable to display preview. Download preview PDF.
- [AaBo 79]S. O. Aanderaa, E. Börger: The Horn complexity of Boolean functions and Cook's problem, Proc. 5th Scand.Logic Symp. (Eds.B.Mayoh, F.Jensen), 1979, 231–256Google Scholar
- [APT 78]
- [DoGa 84]W. F. Dowling and J. H. Gallier: Linear-Time Algorithms For Testing The Satisfiability Of Propositional Horn Formulae, J. of Logic Programming, 1984, 267–284Google Scholar
- [GJ 79]M. R. Garey and D. S: Johnson: Computers and Intractability, A Guide to the Theory of NP-Completeness, W. H. Freemann and Co., New York, 1979Google Scholar
- [Ha 85]
- [KaKB 90]M.Karpinski, H.Kleine Büning: Resolution for Quantified Boolean Formulas, submitted for publicationGoogle Scholar
- [KKBS 87]M. Karpinski, H. Kleine Büning and P.H. Schmitt: On the computational complexity of quantified Horn clauses, Lecture Notes in Computer Science 329, Springer-Verlag, 1987, 129–137Google Scholar
- [StM 73]L. J. Stockmeyer and A. R. Meyer: Word problems requiring exponential time, Proc. 5th Ann. ACM Symp. Theory of Computing, 1973, 1–9Google Scholar