Daniel le Berre,

CRIL – Faculté Jean Perrin, Université d’Artois


The practical use of Quantified Boolean Formulas (QBFs) often calls for
more than solving the validity problem QBF. For this reason we investigate
the corresponding function problems whose expected outputs are policies.
QBFs which do not evaluate to true do not have any solution policy, but
can be of interest nevertheless; for handling them, we introduce a notion
of partial policy. We focus on the representation of policies, considering
QBFs of the form \\\\forall X \\\\exists Y \\\\phi. Because the explicit
representation of policies for such QBFs can be of exponential size,
descriptions as compact as possible must be looked for. To address this
issue, two approaches based on the decomposition and the compilation
of \\\\phi are presented.


Date: 2006-Jul-20     Time: 10:00:00     Room: 336

For more information: