Skip to main content

On Boolean Models for Quantified Boolean Horn Formulas

  • Conference paper
Theory and Applications of Satisfiability Testing (SAT 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2919))

Abstract

For a Quantified Boolean Formula \(({\it QBF })\) Φ=, an assignment is a function \(\cal M\) that maps each existentially quantified variable of Φ to a Boolean function, where φ is a propositional formula and Q is a linear ordering of quantifiers on the variables of Φ. An assignment \(\cal M\) is said to be proper, if for each existentially quantified variable y i , the associated Boolean function f i does not depend upon the universally quantified variables whose quantifiers in Q succeed the quantifier of y i . An assignment \(\cal M\) is said to be a model for Φ, if it is proper and the formula \(\phi^{\cal M}\) is a tautology, where \(\phi^{\cal M}\) is the formula obtained from φ by substituting f i for each existentially quantified variable y i . We show that any true quantified Horn formula has a Boolean model consisting of monotone monomials and constant functions only; conversely, if a QBF has such a model then it contains a clause–subformula in \({\it QHORN }\cap {\it SAT }\).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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)

    Article  MATH  MathSciNet  Google Scholar 

  2. Cadoli, M., Schaerf, M., Giovanardi, A., Giovanardi, M.: An Algorithm to Evaluate Quantified Boolean Formulas and its Evaluation. In: Highlights of Satisfiability Research in the Year 2000. IOS Press, Amsterdam (2000)

    Google Scholar 

  3. Cook, S., Soltys, M.: Boolean Programs and Quantified Propositional Proof Systems. Bulletin of the Section of Logic 28, 119–129 (1999)

    MATH  MathSciNet  Google Scholar 

  4. Davis, M., Logemann, G., Loveland, D.: A Machine Program for Theorem Proving. Communications of the ACM 5, 394–397 (1962)

    Article  MATH  MathSciNet  Google Scholar 

  5. Downey, R., Fellows, M.: Parameterized Complexity. Springer, New York (1999)

    Google Scholar 

  6. Feldmann, R., Monien, B., Schambergers, S.: A Distributed Algorithm to Evaluate Quantified Boolean Formulas. In: proceedings of AAAI (2000)

    Google Scholar 

  7. Flögel, A.: Resolution für quantifizierte Bool’sche Formeln, Ph. D thesis, Universität Paderborn (1993)

    Google Scholar 

  8. Flögel, A., Karpinski, M., Kleine Büning, H.: Resolution for Quantified Boolean Formulas. Information and Computation 117, 12–18 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  9. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman Company, San Francisco (1979)

    MATH  Google Scholar 

  10. Giunchiglia, E., Narizzano, M., Tacchella, A.: QuBE: A System for Deciding Quantified Boolean Formulas. In: Proceedings of IJCAR, Siena (2001)

    Google Scholar 

  11. Haken, A.: The Intractability of Resolution. Theoretical Computer Science 39, 297–308 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  12. Kleine Büning, H., Lettmann, T.: Propositional Logic: Deduction and Algorithms. Cambridge University Press, Cambridge (1999)

    MATH  Google Scholar 

  13. Kullmann, O.: Lean Clause-Sets: Generalizations of Minimal Unsatisfiable Clause- Sets. To appear in Discrete Applied Mathematics (2003)

    Google Scholar 

  14. Letz, R.: Advances in Decision Procedure for Quantified Boolean Formulas. In: Proceedings of IJCAR, Siena (2001)

    Google Scholar 

  15. Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, New York (1994)

    MATH  Google Scholar 

  16. Rintanen, J.T.: Improvements to the Evaluation of Quantified Boolean Formulae. In: Proceedings of IJCAI (1999)

    Google Scholar 

  17. Schaefer, T.J.: The Complexity of Satisfiability Problem. In: Aho, A. (ed.) Proceedings of the 10th Annual ACM Symposium on Theory of Computing, pp. 216–226. ACM Press, New York City (1978)

    Chapter  Google Scholar 

  18. Szeider, S.: Generalization of Matched CNF Formulas. In: 5th International Symposium on Theory and Applications of Satisfiability Testing, Cincinnati, Ohio, USA (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kleine Büning, H., Subramani, K., Zhao, X. (2004). On Boolean Models for Quantified Boolean Horn Formulas. In: Giunchiglia, E., Tacchella, A. (eds) Theory and Applications of Satisfiability Testing. SAT 2003. Lecture Notes in Computer Science, vol 2919. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24605-3_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24605-3_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20851-8

  • Online ISBN: 978-3-540-24605-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics