On the Learnability of Boolean Formulae

@inproceedings{Kearns1987OnTL,
  title={On the Learnability of Boolean Formulae},
  author={Michael Kearns and Ming Li and Leonard Pitt and Leslie G. Valiant},
  booktitle={STOC},
  year={1987}
}
We study the computational feasibility of learning boolean expressions from examples. Our goals are to prove results and develop general techniques that shed light on the boundary between the classes of expressions that are learnable in polynomial time and those that are apparently not. The elucidation of this boundary, for boolean expressions and possibly other knowledge representations, is an example of the potential contribution of complexity theory to arti cial intelligence. We employ the… CONTINUE READING
Highly Influential
This paper has highly influenced 18 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

From This Paper

Figures, tables, and topics from this paper.
191 Citations
0 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 191 extracted citations

Similar Papers

Loading similar papers…