Pac-Learning Recursive Logic Programs: Efficient Algorithms

We present algorithms that learn certain classes of function-free recursive logic programs in polynomial time from equivalence queries. In particular, we show that a single k-ary recursive constant-depth determinate clause is learnable. Two-clause programs consisting of one learnable recursive claus...

Full description

Bibliographic Details

Published in:	The Journal of artificial intelligence research Vol. 2; pp. 501 - 539
Main Author:	Cohen, W. W.
Format:	Journal Article
Language:	English
Published:	San Francisco AI Access Foundation 01.01.1994
Subjects:	Algorithms Artificial intelligence Graphs Logic programs Machine learning Polynomials Recursive functions
ISSN:	1076-9757, 1076-9757, 1943-5037
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!