Inverse subsumption for complete explanatory induction
From MaRDI portal
Publication:439023
DOI10.1007/s10994-011-5250-yzbMath1243.68141OpenAlexW1990279219MaRDI QIDQ439023
Katsumi Inoue, Koji Iwanuma, Yoshitaka Yamamoto
Publication date: 31 July 2012
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10994-011-5250-y
inductive logic programmingexplanatory inductioninverse entailmentinverse subsumptionlearning from entailment
Cites Work
- Unnamed Item
- Nonmonotonic abductive inductive learning
- Foundations of inductive logic programming
- Logical settings for concept-learning
- Hypothesis finding based on upward refinement of residue hypotheses.
- The lattice structure and refinement operators for the hypothesis space bounded by a bottom clause
- Induction on Failure: Learning Connected Horn Theories
- On the Complexity of Dualization of Monotone Disjunctive Normal Forms
- Inductive Logic Programming: Theory and methods
- Mode-Directed Inverse Entailment for Full Clausal Theories
- Induction as consequence finding
- Inductive Logic Programming
This page was built for publication: Inverse subsumption for complete explanatory induction