Abstract
Purchase PDF (167 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (2)
Purchase PDF (515 K)
doi:10.1016/j.ipl.2003.06.001 
Copyright © 2003 Elsevier B.V. All rights reserved.
An efficient algorithm for Horn description
Received 30 January 2003;
revised 26 June 2003.
Communicated by K. Iwama
Available online 26 September 2003.
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
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 Horn relations in a new manner.
Author Keywords: Combinatorial problems; Algorithms; Description; Horn CNF
