Bounded universal expansion for preprocessing QBF

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4501 LNCS, Issue , 2007, Pages 244-257

  Bubeck, Uwe ^a   Büning, Hans Kleine ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDARY CONDITIONS; PARAMETER ESTIMATION; PROBLEM SOLVING; PROGRAM PROCESSORS;

BOUNDED EXPANSION COSTS; BOUNDED UNIVERSAL EXPANSION;

BOOLEAN ALGEBRA;

EID: 38049115712     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72788-0_24     Document Type: Conference Paper

References (18)

1. A. Ayari and D. Basin. QUBOS: Deciding Quantified Boolean Logic using Propositional Satisfiability Solvers. Proc. 4th Intl. Conf. on Formal Methods in Computer-Aided Design (FMCAD'02). Springer LNCS 2517, 2002.
2. M. Benedetti. Evaluating QBFs via Symbolic Skolemization. Proc. 11th Intl. Conf. on Logic for Programming Artificial Intelligence and Reasoning (LPAR'04). Springer LNCS 3452, 2005.
3. M. Benedetti. Quantifier Trees for QBFs. Proc. 8th Intl. Conf. on Theory and Applications of Satisfiability Testing (SAT'05). Springer LNCS 3569, 2005.
4. A. Biere. Resolve and Expand. Proc. 7th Intl. Conf. on Theory and Applications of Satisfiability Testing (SAT'04). Springer LNCS 3542, 2005.
5. U. Bubeck. Design of a Modular Platform for Automated Theorem Proving in Multiple Logics. M.S. Thesis, San Diego State University, 2003.
6. U. Bubeck. ProverBox Automated Reasoning Environment. Website http://www.ub-net.de/cms/proverbox.html, 2006.
7. M. Cadoli, M. Schaerf, A. Giovanardi, and M. Giovanardi. An Algorithm to Evaluate Quantified Boolean Formulae and Its Experimental Evaluation. Journal of Automated Reasoning, 28(2):101-142, 2002.
8. M. Davis, G. Logemann, and D. Loveland. A machine program for theorem-proving. Communications of the ACM, 5(7):394-397, 1962.
9. E. Giunchiglia, M. Narizzano, and A. Tacchella. Quantified Boolean Formulas satisfiability library (QBFLIB). Website http://www.qbflib.org, 2001.
10. E. Giunchiglia, M. Narizzano, and A. Tacchella. QUBE: A system for deciding quantified boolean formulas satisfiability. Proc. 1st Intl. Joint Conf. on Automated Reasoning (IJCAR'01). Springer LNCS 2083, 2001.
11. H. Kleine Büning, M. Karpinski, and A. Flögel. Resolution for Quantified Boolean Formulas. Information and Computation, 117(1):12-18, 1995.
12. A. Meyer and L. Stockmeyer. The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space. Proc. 13th Symp. on Switching and Automata Theory, 1972.
13. M. Mneimneh and K. Sakallah. Computing Vertex Eccentricity in Exponentially Large Graphs: QBF Formulation and Solution. Proc. 6th Intl. Conf. on Theory and Applications of Satisfiability Testing (SAT'03). Springer LNCS 2919, 2004.
14. M. Narizzano, L. Pulina, and A. Tacchella. Report of the Third QBF Solvers Evaluation. Journal of Satisfiability, Boolean Modeling and Computation, 2:145-164, 2006.
15. J. Rintanen. Constructing Conditional Plans by a Theorem-Prover. Journal of Artificial Intelligence Research, 10:323-352, 1999.
16. J. Rintanen. Improvements to the evaluation of quantified Boolean formulae. Proc. 16th Intl. Joint Conf. on Artificial Intelligence (IJCAI'99). Morgan Kaufmann Publishers, 1999.
17. H. Samulowitz and F. Bacchus. Using SAT in QBF. Proc. 11th Intl. Conf. on Principles and Practice of Constraint Programming. Springer LNCS 3709, 2005.
18. L. Zhang and S. Malik. Towards Symmetric Treatment of Conflicts and Satisfaction in Quantified Boolean Satisfiability Solver. Proc. 8th Intl. Conf. on Principles and Practice of Constraint Programming (CP'02), 2002.