An efficient algorithm for Horn description

Jean-Jacques Hébrard (1) , Bruno Zanuttini (2)

1 GREYC - Groupe de Recherche en Informatique, Image et Instrumentation de Caen
2 Equipe MAD - Laboratoire GREYC - UMR6072

We give a new algorithm for computing a propositional Horn CNF given the set of its models. Its running time is O(|R|n(|R|+n)), where R is the number of models and n that of variables, and the computed CNF contains at most |R|n clauses.This algorithm also uses the well-known closure property of Horn relations in a new manner.

Domaines: Intelligence artificielle [cs.AI]

Jean-Jacques Hébrard, Bruno Zanuttini. An efficient algorithm for Horn description. Information Processing Letters, 2003, 88 (4), pp.177-182. ⟨hal-00995236⟩