A BDD-Based Algorithm for Learning from Interpretation Transition

Tony Ribeiro (1, 2) , Katsumi Inoue (1) , Chiaki Sakama (3)

1 NII - National Institute of Informatics
2 SOKENDAI - Graduate University for Advanced Studies [Hayama]
3 Department of Computer and Communication Sciences

In recent years, there has been an extensive interest in learning the dynamics of systems. For this purpose, a new learning method called learning from interpretation transition has been proposed recently [1]. However, both the run time and the memory space of this algorithm are exponential, so a better data structure and an efficient algorithm have been awaited. In this paper, we propose a new learning algorithm of this method utilizing an efficient data structure inspired from Ordered Binary Decision Diagrams. We show empirically that using this representation we can perform the same learning task faster with less memory space.

Domains: Computer Science [cs]; Artificial Intelligence [cs.AI]; Machine Learning [cs.LG]; Logic in Computer Science [cs.LO]

Tony Ribeiro, Katsumi Inoue, Chiaki Sakama. A BDD-Based Algorithm for Learning from Interpretation Transition. The 23rd International Conference on Inductive Logic Programming, Aug 2013, Rio de Janeiro, Brazil. ⟨hal-01710488⟩