On Models for Quantified Boolean Formulas-Reference-Cited by-同舟云学术

On Models for Quantified Boolean Formulas

Published:2004 Issue: Volume: Page:18-32
ISSN:0302-9743
Container-title:Logic versus Approximation
language:
Short-container-title:

Author:

Büning Hans Kleine,Zhao Xishun

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-25967-1_3.pdf

Reference12 articles.

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)

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)

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

4. Feldmann, R., Monien, B., Schamberger, S.: A Distributed Algorithm to Evaluate Quantified Boolean Formulas. In: Proceedings of AAAI (2000)

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

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Resolution-Based Certificate Extraction for QBF;Theory and Applications of Satisfiability Testing – SAT 2012;2012

2. Proving Valid Quantified Boolean Formulas in HOL Light;Interactive Theorem Proving;2011

3. Validating QBF Validity in HOL4;Interactive Theorem Proving;2011

4. A First Step Towards a Unified Proof Checker for QBF;Theory and Applications of Satisfiability Testing – SAT 2007