Learning Prime Implicant Conditions from Interpretation Transition
In a previous work we proposed a framework for learning normal logic programs from transitions of interpretations. Given a set of pairs of interpretations (I, J) such that $$J=T_P(I)$$ , where $$T_P$$ is the immediate consequence operator, we infer the program P. Here we propose a new learning appro...
Saved in:
Published in | Inductive Logic Programming Vol. 9046; pp. 108 - 125 |
---|---|
Main Authors | , |
Format | Book Chapter |
Language | English |
Published |
Switzerland
Springer International Publishing AG
01.01.2015
Springer International Publishing |
Series | Lecture Notes in Computer Science |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!