Learning conjunctions of Horn clauses
- Cite this article as:
- Angluin, D., Frazier, M. & Pitt, L. Mach Learn (1992) 9: 147. doi:10.1007/BF00992675
- 485 Downloads
An algorithm is presented for learning the class of Boolean formulas that are expressible as conjunctions of Horn clauses. (A Horn clause is a disjunction of literals, all but at most one of which is a negated variable.) 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.