Learning from interpretation transition

Abstract : We propose a novel 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. The learning framework can be repeatedly applied for identifying Boolean networks from basins of attraction. Two algorithms have been implemented for this learning task, and are compared using examples from the biological literature. We also show how to incorporate background knowledge and inductive biases, then apply the framework to learning transition rules of cellular automata.
Complete list of metadatas

Cited literature [46 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01710483
Contributor : Tony Ribeiro <>
Submitted on : Friday, February 16, 2018 - 7:50:04 AM
Last modification on : Tuesday, February 20, 2018 - 12:55:40 PM
Long-term archiving on: Saturday, May 5, 2018 - 6:38:04 PM

File

MLJ2013.pdf
Files produced by the author(s)

Identifiers

Citation

Katsumi Inoue, Tony Ribeiro, Chiaki Sakama. Learning from interpretation transition. Machine Learning, Springer Verlag, 2014, 94 (1), pp.51 - 79. ⟨10.1007/s10994-013-5353-8⟩. ⟨hal-01710483⟩

Share

Metrics

Record views

65

Files downloads

141