Abstract
In this paper, we consider learning first-order Horn programs from entailment. In particular, we show that any subclass of first-order acyclic Horn programs with constant arity is exactly learnable from equivalence and entailment membership queries provided it allows a polynomial-time subsumption procedure and satisfies some closure conditions. One consequence of this is that first-order acyclic determinate Horn programs with constant arity are exactly learnable from equivalence and entailment membership queries.
Cite
CITATION STYLE
Reddy, C., & Tadepalli, P. (1998). Learning first-order acyclic horn programs from entailment. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1446, pp. 23–37). Springer Verlag. https://doi.org/10.1007/bfb0027308
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
