Communications of the ACM
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Foundations of deductive databases and logic programming
Foundations of deductive databases and logic programming
Foundations of deductive databases and logic programming
Learning Conjunctions of Horn Clauses
Machine Learning - Computational learning theory
First-order jk-clausal theories are PAC-learnable
Artificial Intelligence
When won't membership queries help?
Selected papers of the 23rd annual ACM symposium on Theory of computing
On the complexity of database queries (extended abstract)
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Logical settings for concept-learning
Artificial Intelligence
Algorithmic Program DeBugging
Foundations of Inductive Logic Programming
Foundations of Inductive Logic Programming
Learning Conjunctive Concepts in Structural Domains
Machine Learning
Machine Learning
Machine Learning
Learning Goal-Decomposition Rules using Exercises
ICML '97 Proceedings of the Fourteenth International Conference on Machine Learning
Learning Acyclic First-Order Horn Sentences from Entailment
ALT '97 Proceedings of the 8th International Conference on Algorithmic Learning Theory
Learning from Entailment of Logic Programs with Local Variables
ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
Learning Horn Definitions with Equivalence and Membership Queries
ILP '97 Proceedings of the 7th International Workshop on Inductive Logic Programming
Learning First-Order Acyclic Horn Programs from Entailment
ILP '98 Proceedings of the 8th International Workshop on Inductive Logic Programming
Pac-learning recursive logic programs: efficient algorithms
Journal of Artificial Intelligence Research
Pac-learning recursive logic programs: negative results
Journal of Artificial Intelligence Research
Learning disjunction of conjunctions
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
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
| Hi-index | 0.00 |
We study the learnability of first order Horn expressions from equivalence and membership queries. We show that the class of range restricted Horn expressions, where every term in the consequent of every clause appears also in the antecedent of the clause, is learnable. The result holds both for the model where interpretations are examples (learning from interpretations) and the model where clauses are examples (learning from entailment). The paper utilises a previous result on learning function free Horn expressions. This is done by using techniques for flattening and unflattening of examples and clauses, and a procedure for model finding for range restricted expressions. This procedure can also be used to solve the implication problem for this class.