Learning Function-Free Horn Expressions
Machine Learning - The Eleventh Annual Conference on computational Learning Theory
Polynomial-time learnability of logic programs with local variables from entailment
Theoretical Computer Science - Algorithmic learning theory
How to upgrade propositional learners to first order logic: case study
Relational Data Mining
Learning closed horn expressions
Information and Computation
Learning Range Restricted Horn Expressions
EuroCOLT '99 Proceedings of the 4th European Conference on Computational Learning Theory
How to Upgrade Propositional Learners to First Order Logic: A Case Study
Machine Learning and Its Applications, Advanced Lectures
On the Hardness of Learning Acyclic Conjunctive Queries
ALT '00 Proceedings of the 11th International Conference on Algorithmic Learning Theory
A New Algorithm for Learning Range Restricted Horn Expressions
ILP '00 Proceedings of the 10th International Conference on Inductive Logic Programming
Polynomial certificates for propositional classes
Information and Computation
Complexity parameters for first order classes
Machine Learning
Prediction-hardness of acyclic conjunctive queries
Theoretical Computer Science - Algorithmic learning theory (ALT 2000)
Learning Horn Expressions with LOGAN-H
The Journal of Machine Learning Research
Relational learning for NLP using linear threshold elements
IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
Polynomial certificates for propositional classes
Information and Computation
The subsumption lattice and query learning
Journal of Computer and System Sciences
Learning hereditary and reductive prolog programs from entailment
ICIC'09 Proceedings of the Intelligent computing 5th international conference on Emerging intelligent computing technology and applications
Learning first-order definite theories via object-based queries
ECML PKDD'11 Proceedings of the 2011 European conference on Machine learning and knowledge discovery in databases - Volume Part III
Learnability of simply-moded logic programs from entailment
ASIAN'04 Proceedings of the 9th Asian Computing Science conference on Advances in Computer Science: dedicated to Jean-Louis Lassez on the Occasion of His 5th Cycle Birthday
| Hi-index | 0.00 |