Intensional learning of logic programs [chapter]

D. Gunetti, U. Trinchero
1994 Lecture Notes in Computer Science  
In this paper we investigate the possibility of learning logic programs by using an intensional evaluation of clauses. Unlike learning methods based on extensionality, by adopting an intensional evaluation of clauses the learning algorithm presented in this paper is correct and sufficient and does not depend on the kind of examples provided. Since searching a space of possible programs (instead of a space of independent clauses) is unfeasible, only partial programs containing clauses
more » ... y used to derive at least one positive example are taken into consideration. Since clauses are not learned independently of each others, backtracking may be required.
doi:10.1007/3-540-57868-4_73 fatcat:ox2zhkitizclhp3ajpu6jc3oue