Pré-Publication, Document De Travail Année : 2025

Polynomial prenexing of QBFs with non-monotone boolean operators

Abdallah Saffidine
  • Fonction : Auteur
  • PersonId : 1005786

Résumé

It is well-known that every quantified boolean formula (QBF) can be transformed into a prenex QBF whose only boolean operators are negation, conjunction, and disjunction. It is also well-known that the transformation is polynomial if the boolean operators of the original QBF are restricted to negation, conjunction, and disjunction. In contrast, up to now no polynomial transformation has been found when the original QBF contains other boolean operators such as biconditionals or exclusive disjunction. We define such a transformation and show that it is polynomial and preserves quantifier depth.

Fichier principal
Vignette du fichier
main.pdf (309.55 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence

Dates et versions

hal-05101903 , version 1 (11-06-2025)

Licence

Identifiants

  • HAL Id : hal-05101903 , version 1

Citer

Abdallah Saffidine, Andreas Herzig. Polynomial prenexing of QBFs with non-monotone boolean operators. 2025. ⟨hal-05101903⟩
1873 Consultations
131 Téléchargements

Partager

  • More