An Algorithm to Evaluate Quantified Boolean Formulae and Its Experimental Evaluation |
| |
Authors: | Marco Cadoli Marco Schaerf Andrea Giovanardi Massimo Giovanardi |
| |
Affiliation: | (1) Dipartimento di Informatica e Sistemistica, Università di Roma La Sapienza, Via Salaria 113, I-00198 Roma, Italy. e-mail |
| |
Abstract: | The high computational complexity of advanced reasoning tasks such as reasoning about knowledge and planning calls for efficient and reliable algorithms for reasoning problems harder than NP. In this paper we propose Evaluate, an algorithm for evaluating quantified Boolean formulae (QBFs). Algorithms for evaluation of QBFs are suitable for experimental analysis of problems that belong to a wide range of complexity classes, a property not easily found in other formalisms. Evaluate is a generalization of the Davis–Putnam procedure for SAT and is guaranteed to work in polynomial space. Before presenting the algorithm, we discuss several abstract properties of QBFs that we singled out to make it more efficient. We also discuss various options that were investigated about heuristics and data structures and report the main results of the experimental analysis. In particular, Evaluate is orders of magnitude more efficient than a nested backtracking procedure that resorts to a Davis–Putnam algorithm for handling the innermost set of quantifiers. Moreover, experiments show that randomly generated QBFs exhibit regular patterns such as phase transition and easy-hard-easy distribution. |
| |
Keywords: | quantified Boolean formulas SAT algorithms |
本文献已被 SpringerLink 等数据库收录! |
|