Theory of Quantified Boolean Formulas
Kleine Büning Hans, Bubeck Uwe · Frontiers in artificial intelligence and applications · 2009
Quantified Boolean formulas (QBF) are a generalization of propositional formulas by allowing universal and existential quantifiers over variables. This enhancement makes QBF a concise and natural modeling language in which problems from many areas, such as planning, scheduling or verification, can often be encoded in a more compact way than with propositional formulas.