Pac-learning recursive logic programs

W CohenWilliam · 1995

In a companion paper it was shown that the class of constant-depth determinate k-ary recursive clauses is efficiently learnable. In this paper we present negative results showing that any natural g...

Read the paper · More papers on PaperTik