Angluin, Dana; Frazier, Michael; Pitt, Leonard Learning conjunctions of Horn clauses. (English) Zbl 0766.68107 Mach. Learn. 9, No. 2-3, 147-164 (1992). Summary: An algorithm is presented for learning the class of Boolean formulas that are expressible as conjunctions of Horn clauses. The algorithm uses equivalence queries and membership queries to produce a formula that is logically equivalent to the unknown formula to be learned. The amount of time used by the algorithm is polynomial in the number of variables and the number of clauses in the unknown formula. Cited in 1 ReviewCited in 54 Documents MSC: 68T05 Learning and adaptive systems in artificial intelligence Keywords:propositional Horn sentences; exact identification; polynomial time learning; equivalence queries; membership queries PDFBibTeX XMLCite \textit{D. Angluin} et al., Mach. Learn. 9, No. 2--3, 147--164 (1992; Zbl 0766.68107)