Abstract
We present sKizzo, a system designed to evaluate and certify QBFs by means of propositional skolemization and symbolic reasoning.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ayari, A., Basin, D.: Bounded Model Construction for Monadic Second-order Logics. In: Proc. of CAV 2000 (2000)
Benedetti, M.: sKizzo: a QBF Decision Procedure based on Propositional Skolemization and Symbolic Reasoning, Tech.Rep. 04-11-03, ITC-irst (2004)
Benedetti, M.: sKizzo’s web site (2004), http://sra.itc.it/people/benedetti/sKizzo
Benedetti, M.: Evaluating qBFs via symbolic skolemization. In: Baader, F., Voronkov, A. (eds.) LPAR 2004. LNCS (LNAI), vol. 3452, pp. 285–300. Springer, Heidelberg (2005)
Benedetti, M.: Extracting Certificates from Quantified Boolean Formulas. In: Proc. of IJCAI 2005 (2005)
Benedetti, M.: Quantifier trees for qBFs. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol. 3569, pp. 378–385. Springer, Heidelberg (2005)
Biere, A.: Resolve and expand. In: Hoos, H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol. 3542, pp. 59–70. Springer, Heidelberg (2005)
Giunchiglia, E., Narizzano, M., Tacchella, A.: QuBE: A system for deciding Quantified Boolean Formulas Satisfiability. In: Proc. of the International Joint Conference on Automated Reasoning, IJCAR 2001 (2001)
Le Berre, D., Narizzano, M., Simon, L., Tacchella, A.: Second QBF solvers evaluation, avaliable on-line (2004), at http://www.qbflib.org
Letz, R.: Advances in Decision Procedures for Quantified Boolean Formulas. In: Proceedings of the First International Workshop on Quantified Boolean Formulae (QBF 2001), pp. 55–64 (2001)
Zhang, L., Malik, S.: Towards Symmetric Treatment of Conflicts And Satisfaction in Quantified Boolean Satisfiability Solver. In: Proc. of CP 2002 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Benedetti, M. (2005). sKizzo: A Suite to Evaluate and Certify QBFs. In: Nieuwenhuis, R. (eds) Automated Deduction – CADE-20. CADE 2005. Lecture Notes in Computer Science(), vol 3632. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11532231_27
Download citation
DOI: https://doi.org/10.1007/11532231_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28005-7
Online ISBN: 978-3-540-31864-4
eBook Packages: Computer ScienceComputer Science (R0)