Sciweavers

SAT
2009
Springer
109views Hardware» more  SAT 2009»
13 years 11 months ago
A Compact Representation for Syntactic Dependencies in QBFs
Different quantifier types in Quantified Boolean Formulae (QBF) introduce variable dependencies which have to be taken into consideration when deciding satisfiability of a QBF....
Florian Lonsing, Armin Biere