Models of Horn Formulas are Enumerable at Nearly Linear Delay

Johann Brault-Baron (1)

1 Equipe AMACC - Laboratoire GREYC - UMR6072

The Unique satisfiability problem of Horn formulas was proved to be quadratic by Minoux (1992) [3]. Using ideas based on those of [3], Berman, Franco, and Schilpf (1995) [1] proved it to be nearly linear. We simplify the presentation of their algorithm and adapt it slightly in order to perform enumeration of the solutions at a delay that is their unique solution decision time, i.e. O(\alpha(|F |)|F |) where |F| is the formula size and \alpha is the inverse Ackermann function, or (at choice) O(n log n + |F |) where n is the number of variables of F .

Mots clés: propositional Horn formula; enumeration algorithm; nearly linear time

Domaines: Complexité [cs.CC]

Johann Brault-Baron. Models of Horn Formulas are Enumerable at Nearly Linear Delay. 2012. ⟨hal-00786152⟩