Learning conjunctions of Horn clauses

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.

[1]  Dana Angluin,et al.  When won't membership queries help? , 1991, STOC '91.

[2]  David Haussler,et al.  Quantifying Inductive Bias: AI Learning Algorithms and Valiant's Learning Framework , 1988, Artif. Intell..

[3]  David Haussler,et al.  Learnability and the Vapnik-Chervonenkis dimension , 1989, JACM.

[4]  Marek Karpinski,et al.  Learning read-once formulas with queries , 1993, JACM.

[5]  Michael Frazier,et al.  Learning conjunctions of Horn clauses , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[6]  Dana Angluin,et al.  Learning with hints , 1988, COLT '88.

[7]  Leonard Pitt,et al.  Prediction-Preserving Reducibility , 1990, J. Comput. Syst. Sci..

[8]  Dana Angluin,et al.  Queries and concept learning , 1988, Machine Learning.

[9]  Neil D. Jones,et al.  Complete problems for deterministic polynomial time , 1974, STOC '74.

[10]  David Haussler,et al.  Predicting {0,1}-functions on randomly drawn points , 1988, COLT '88.

[11]  D. Angluin.  Negative Results for Equivalence Queries , 1990, Machine Learning.

[12]  David Haussler,et al.  Learning Conjunctive Concepts in Structural Domains , 1989, Machine Learning.

[13]  Ronald L. Rivest,et al.  Learning decision lists , 2004, Machine Learning.

[14]  Leslie G. Valiant,et al.  A theory of the learnable , 1984, STOC '84.

[15]  N. Littlestone.  Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[16]  Leslie G. Valiant,et al.  On the learnability of Boolean formulae , 1987, STOC.

[17]  David Haussler,et al.  Learning decision trees from random examples , 1988, COLT '88.

[18]  Leslie G. Valiant,et al.  Cryptographic Limitations on Learning Boolean Formulae and Finite Automata , 1993, Machine Learning: From Theory to Applications.