Login / Signup
Complexity Results for Quantified Boolean Formulae Based on Complete Propositional Languages.
Sylvie Coste-Marquis
Daniel Le Berre
Florian Letombe
Pierre Marquis
Published in:
J. Satisf. Boolean Model. Comput. (2006)
Keyphrases
</>
quantified boolean formulae
propositional logic
propositional formulas
first order logic
prime implicates
expressive power
knowledge compilation
pspace complete
symmetry breaking
belief revision
space complexity
prime implicants
quantified boolean formulas