Some lower bounds for the computational complexity of inductive logic programming
- 1 January 1993
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- PAC-learnability of determinate logic programsPublished by Association for Computing Machinery (ACM) ,1992
- Determinate Literals in Inductive Logic ProgrammingPublished by Elsevier ,1991
- Completeness for inductive proceduresPublished by Elsevier ,1991