Representing Policies for Quantified Boolean Formulae

Sylvie Coste-Marquis (1) , Hélène Fargier (2, 3) , Jérôme Lang (2, 3) , Daniel Le Berre (1) , Pierre Marquis (1)

1 CRIL - Centre de Recherche en Informatique de Lens
2 IRIT-ADRIA - Argumentation, Décision, Raisonnement, Incertitude et Apprentissage
3 CNRS - Centre National de la Recherche Scientifique

The practical use of Quantified Boolean Formulae (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 ∀X ∃Y Φ. 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 Φ are presented.

Domaines: Intelligence artificielle [cs.AI]

Sylvie Coste-Marquis, Hélène Fargier, Jérôme Lang, Daniel Le Berre, Pierre Marquis. Representing Policies for Quantified Boolean Formulae. Tenth International Conference on Principles of Knowledge Representation and Reasoning, Jun 2006, Lake District, United Kingdom. pp.286-296. ⟨hal-00121155⟩