An efficient algorithm for Horn description
We give a new algorithm for computing a prepositional Horn CNF formula 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 Hom relations in a new manner. (C) 2003 Elsevier B.V. All rights reserved.
algorithms description horn cnf combinatorial problems