Abstract
The majority of the currently available solvers for quantified Boolean formulas (QBFs) process input formulas only in prenex conjunctive normal form. However, the natural representation of practicably relevant problems in terms of QBFs usually results in formulas which are not in a specific normal form. Hence, in order to evaluate such QBFs with available solvers, suitable normal-form translations are required. In this paper, we report experimental results comparing different prenexing strategies on a class of structured benchmark problems. The problems under consideration encode the evaluation of nested counterfactuals over a propositional knowledge base, and span the entire polynomial hierarchy. The results show that different prenexing strategies influence the evaluation time in different ways across different solvers. In particular, some solvers are robust to the chosen strategies while others are not.
This work was partially supported by the Austrian Science Fund (FWF) under grant P15068.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Ayari, A., Basin, D.: QUBOS: Deciding Quantified Boolean Logic Using Propositional Satisfiability Solvers. In: Aagaard, M.D., O’Leary, J.W. (eds.) FMCAD 2002. LNCS, vol. 2517, pp. 187–201. Springer, Heidelberg (2002)
Baaz, M., Leitsch, A.: On Skolemization and Proof Complexity. Fundamenta Informaticae 20, 353–379 (1994)
Cadoli, M., Eiter, T., Gottlob, G.: Complexity of Nested Circumscription and Abnormality Theories. In: Proc. IJCAI 2001, pp. 169–174. Morgan Kaufmann, San Francisco (2001)
Egly, U.: Quantifiers and the System KE: Some Surprising Results. In: Gottlob, G., Grandjean, E., Seyr, K. (eds.) CSL 1998. LNCS, vol. 1584, pp. 90–104. Springer, Heidelberg (1999)
Egly, U., Eiter, T., Tompits, H., Woltran, S.: Solving Advanced Reasoning Tasks Using Quantified Boolean Formulas. In: Proc. AAAI 2000, pp. 417–422. AAAI/MIT Press (2000)
Egly, U., Tompits, H., Woltran, S.: On Quantifier Shifting for Quantified Boolean Formulas. In: Proc. SAT 2002 Workshop on Theory and Applications on QBFs, pp. 48–61 (2002)
Eiter, T., Gottlob, G.: The Complexity of Nested Counterfactuals and Iterated Knowledge Base Revisions. Journal of Computer and System Sciences 53(3), 497–512 (1996)
Feldmann, R., Monien, B., Schamberger, S.: A Distributed Algorithm to Evaluate Quantified Boolean Formulas. In: Proc. AAAI 2000, pp. 285–290. AAAI/MIT Press (2000)
Giunchiglia, E., Narizzano, M., Tacchella, A.: QuBE: A System for Deciding Quantified Boolean Formulas Satisfiability. In: Goré, R.P., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS (LNAI), vol. 2083, pp. 364–369. Springer, Heidelberg (2001)
Goubault, J.: A BDD-Based Simplification and Skolemization Procedure. Logic Journal of the IGPL 3(6), 827–855 (1995)
Letz, R.: Lemma and Model Caching in Decision Procedures for Quantified Boolean Formulas. In: Egly, U., Fermüller, C. (eds.) TABLEAUX 2002. LNCS (LNAI), vol. 2381, pp. 160–175. Springer, Heidelberg (2002)
Nebel, B.: Belief Revision and Default Reasoning: Syntax-Based Approaches. In: Proc. KR 1991, pp. 417–428. Morgan Kaufmann, San Francisco (1991)
Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)
Rintanen, J.: Constructing Conditional Plans by a Theorem Prover. Journal of Artificial Intelligence Research 10, 323–352 (1999)
Stockmeyer, L.J.: The Polynomial-Time Hierarchy. Theoretical Computer Science 3(1), 1–22 (1977)
Zhang, L., Malik, S.: Towards a Symmetric Treatment of Satisfaction and Conflicts in Quantified Boolean Formula Evaluation. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 200–215. Springer, Heidelberg (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Egly, U., Seidl, M., Tompits, H., Woltran, S., Zolda, M. (2004). Comparing Different Prenexing Strategies for Quantified Boolean 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_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-24605-3_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20851-8
Online ISBN: 978-3-540-24605-3
eBook Packages: Springer Book Archive