Advertisement

Minimal False Quantified Boolean Formulas

  • Hans Kleine Büning
  • Xishun Zhao
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4121)

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.

Keywords

Polynomial Time Induction Hypothesis Truth Assignment Boolean Formula Propositional Formula 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Aspvall, B., Plass, M.F., Tarjan, R.E.: A Linear–Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas. Information Processing Letters 8, 121–123 (1979)MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Davydov, G., Davydova, I., Kleine Büning, H.: An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF. Annals of Mathematics and Artificial Intelligence 23, 229–245 (1998)MATHCrossRefMathSciNetGoogle Scholar
  3. 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
  4. 4.
    Fleischner, H., Kullmann, O., Szeider, S.: Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable deficiency. Theoretical Computer Scicence 289, 503–516 (2002)MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Kleine Büning, H.: On Some Subclasses of Minimal Unsatisfiable Formulas. Discrete Applied Mathematics 107, 83–98 (2000)MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Kleine Büning, H., Lettmann, T.: Propositional Logic: Deduction and Algorithms. Cambridge University Press, Cambridge (1999)MATHGoogle Scholar
  7. 7.
    Kleine Büning, H., Zhao, X.: On the structure of some classes of minimal unsatisfiable formulas. Discrete Applied Mathematics 130(2), 185–207 (2003)MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Kullmann, O.: An Application of Matroid Theory to the ASAT Problem, Electronic Colloquium on Computational Complexity, Report 18 (2000)Google Scholar
  9. 9.
    Kullmann, O.: Lean-sets: Generalizations of minimal unsatisfiable clause-sets. Discrete Applied Mathematics 130, 209–249 (2003)MATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Kullmann, O.: The Combinatorics of Conflicts between Clauses. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 426–440. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  11. 11.
    Papadimitriou, C.H., Wolfe, D.: The complexity of facets resolved. Journal of Computer and System Science 37, 2–13 (1988)MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Hans Kleine Büning
    • 1
  • Xishun Zhao
    • 2
  1. 1.Department of Computer ScienceUniversität PaderbornPaderbornGermany
  2. 2.Institute of Logic and CognitionSun Yat-sen UniversityGuangzhouP.R. China

Personalised recommendations