Boolean Propagation Based on Literals for Quantified Boolean Formulae
Igor Stéphan · European Conference on Artificial Intelligence · 2006
This paper proposes a new set of propagation rules for quantified Boolean formulae based on literals and generated automatically thanks to quantified Boolean formulae certificates. Different decompositions by introduction of existentially quantified variables are discussed in order to construct complete systems. This set of rules is compared with already proposed quantified Boolean propagation rule sets and Stalmarck's method.