W. W. Cohen. Recovering software speci cations with inductive logic programming. In Proceedings of the Eleventh National Conference on Arti cial Intelligence, Seattle, WA, 1994. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Polynomial Learnability and Inductive Logic Programming.. - Cohen, Page, Jr. (1995) (15 citations) Self-citation (Cohen) (Correct)
....be evaluated in polynomial time. Pac predictability of a language family L[B] is de ned analogously to uniform pac learnability. We note that in ILP applications, it has often been important that the output of the learning system is expressed in an understandable language [ King et al. 1992; Cohen, 1994c ] Because of this a pac prediction algorithm may be much less desirable than a pac learning algorithm. For purposes of analysis, however, this learning model is quite useful. Previous results in computational learning theory have shown that there are two di erent reasons that a language L may ....
W. W. Cohen. Recovering software speci cations with inductive logic programming. In Proceedings of the Eleventh National Conference on Arti cial Intelligence, Seattle, WA, 1994.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC