Communications of the ACM
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Equivalence queries and approximate fingerprints
COLT '89 Proceedings of the second annual workshop on Computational learning theory
PAC-learnability of determinate logic programs
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
The Utility of Knowledge in Inductive Learning
Machine Learning
Interactive Concept-Learning and Constructive Induction by Analogy
Machine Learning
Inverting implication with small training sets
ECML-94 Proceedings of the European conference on machine learning on Machine Learning
Sample PAC-learnability in model inference
ECML-94 Proceedings of the European conference on machine learning on Machine Learning
Flattening and Saturation: Two Representation Changes for Generalization
Machine Learning - Special issue on evaluating and changing representation
Pac-learning nondeterminate clauses
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Inducing deterministic Prolog parsers from treebanks: a machine learning approach
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Pac-learning non-recursive Prolog clauses
Artificial Intelligence
A Methodology for LISP Program Construction from Examples
Journal of the ACM (JACM)
Algorithmic Program DeBugging
Learning Logical Definitions from Relations
Machine Learning
Machine Learning
Machine Learning
Two Methods for Improving Inductive Logic Programming Systems
ECML '93 Proceedings of the European Conference on Machine Learning
ECML '93 Proceedings of the European Conference on Machine Learning
Background Knowledge and Declarative Bias in Inductive Concept Learning
AII '92 Proceedings of the International Workshop on Analogical and Inductive Inference
Pac-learning recursive logic programs: negative results
Journal of Artificial Intelligence Research
Learning logic programs by using the product homomorphism method
COLT '97 Proceedings of the tenth annual conference on Computational learning theory
Learning first order universal Horn expressions
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
Learning atomic formulas with prescribed properties
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
Machine Learning
Learning Function-Free Horn Expressions
Machine Learning - The Eleventh Annual Conference on computational Learning Theory
Learning closed horn expressions
Information and Computation
Mind change complexity of learning logic programs
Theoretical Computer Science
Mind Change Complexity of Learning Logic Programs
EuroCOLT '99 Proceedings of the 4th European Conference on Computational Learning Theory
Learning Range Restricted Horn Expressions
EuroCOLT '99 Proceedings of the 4th European Conference on Computational Learning Theory
Logical Aspects of Several Bottom-Up Fittings
ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
On the Hardness of Learning Acyclic Conjunctive Queries
ALT '00 Proceedings of the 11th International Conference on Algorithmic Learning Theory
On Sufficient Conditions for Learnability of Logic Programs from Positive Data
ILP '99 Proceedings of the 9th International Workshop on Inductive Logic Programming
A New Algorithm for Learning Range Restricted Horn Expressions
ILP '00 Proceedings of the 10th International Conference on Inductive Logic Programming
Learning in natural language: theory and algorithmic approaches
ConLL '00 Proceedings of the 2nd workshop on Learning language in logic and the 4th conference on Computational natural language learning - Volume 7
Complexity parameters for first order classes
Machine Learning
Prediction-hardness of acyclic conjunctive queries
Theoretical Computer Science - Algorithmic learning theory (ALT 2000)
Generalization of clauses under implication
Journal of Artificial Intelligence Research
Pac-learning recursive logic programs: negative results
Journal of Artificial Intelligence Research
Relational learning for NLP using linear threshold elements
IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
The complexity of theory revision
Artificial Intelligence
Learning with feature description logics
ILP'02 Proceedings of the 12th international conference on Inductive logic programming
Generalization behaviour of alkemic decision trees
ILP'05 Proceedings of the 15th international conference on Inductive Logic Programming
Proceedings of the 15th International Conference on Database Theory
ACM Transactions on Database Systems (TODS) - Invited papers issue
| Hi-index | 0.00 |
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 clause and one constant-depth determinate nonrecursive clause are also learnable, if an additional "basecase" oracle is assumed. These results immediately imply the pac-learnability of these classes. Although these classes of learnable recursive programs are very constrained, it is shown in a companion paper that they are maximally general, in that generalizing either class in any natural way leads to a computationally difficult learning problem. Thus, taken together with its companion paper, this paper establishes a boundary of efficient learnability for recursive logic programs.