Title: First-order jk-clausal theories are pac-learnable
Authors: De Raedt, Luc ×
Dzeroski, Saso #
Issue Date: Oct-1994
Publisher: Elsevier science bv
Series Title: Artificial intelligence vol:70 issue:1-2 pages:375-392
Abstract: We present positive PAC-learning results for the nonmonotonic inductive logic programming setting. In particular, we show that first-order range-restricted clausal theories that consist of clauses with up to k literals of size at most j each are polynomial-sample polynomial-time PAC-learnable with one-sided error from positive examples only. In our framework, concepts are clausal theories and examples are finite interpretations. We discuss the problems encountered when learning theories which only have infinite nontrivial models and propose a way to avoid these problems using a representation change called flattening. Finally, we compare our results to PAC-learnability results for the normal inductive logic programming setting.
ISSN: 0004-3702
Publication status: published
KU Leuven publication type: IT
Appears in Collections:Informatics Section
× corresponding author
# (joint) last author

Files in This Item:
File Status SizeFormat
aij94.pdf Published 194KbAdobe PDFView/Open


All items in Lirias are protected by copyright, with all rights reserved.

© Web of science