Skip to Main content Skip to Navigation
Journal articles

Enumerating models of DNF faster: breaking the dependency on the formula size

Florent Capelli 1 Yann Strozecki 2
1 LINKS - Linking Dynamic Data
Inria Lille - Nord Europe, CRIStAL - Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189
Abstract : In this article, we study the problem of enumerating the models of DNF formulas. The aim is to provide enumeration algorithms with a delay that depends polynomially on the size of each model and not on the size of the formula. We succeed for two subclasses of DNF formulas: we provide a constant delay algorithm for k-DNF with fixed k by an appropriate amortization method and we give a polynomial delay algorithm for monotone formulas. We then focus on the average delay of enumeration algorithms and show that we can bring down the dependency of the average delay to the square root of the formula size and even to a logarithmic dependency for monotone formulas.
Document type :
Journal articles
Complete list of metadata

Cited literature [29 references]  Display  Hide  Download
Contributor : Florent Capelli <>
Submitted on : Tuesday, October 9, 2018 - 4:12:47 PM
Last modification on : Thursday, July 8, 2021 - 1:52:28 PM


Files produced by the author(s)



Florent Capelli, Yann Strozecki. Enumerating models of DNF faster: breaking the dependency on the formula size. Discrete Applied Mathematics, Elsevier, 2020, ⟨10.1016/j.dam.2020.02.014⟩. ⟨hal-01891483⟩



Record views


Files downloads