An efficient algorithm for Horn description
Résumé
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]
Origine : Fichiers produits par l'(les) auteur(s)