Changing Partitions in Rectangle Decision Lists - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2022

Changing Partitions in Rectangle Decision Lists

Stefan Mengel

Résumé

Rectangle decision lists are a form of decision lists that were recently shown to have applications in the proof complexity of certain OBDD-based QBF-solvers. We consider a version of rectangle decision lists with changing partitions, which corresponds to QBF-solvers that may change the variable order of the OBDDs they produce. We show that even allowing one single partition change generally leads to exponentially more succinct decision lists. More generally, we show that there is a succinctness hierarchy: for every k ∈ N, when going from k partition changes to k + 1, there are functions that can be represented exponentially more succinctly. As an application, we show a similar hierarchy for OBDD-based QBF-solvers.
Fichier principal
Vignette du fichier
orders.pdf (556.19 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte

Dates et versions

hal-03864946 , version 1 (22-11-2022)

Licence

Paternité

Identifiants

Citer

Stefan Mengel. Changing Partitions in Rectangle Decision Lists. 25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022), Meel, Kuldeep S. and Strichman, Ofer, Aug 2022, Haifa, Israel. pp.17:1--17:20, ⟨10.4230/LIPIcs.SAT.2022.17⟩. ⟨hal-03864946⟩
12 Consultations
15 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More