Learning from interpretation transition

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...

Full description

Saved in:
Bibliographic Details
Published in:Machine learning Vol. 94; no. 1; pp. 51 - 79
Main Authors: Inoue, Katsumi, Ribeiro, Tony, Sakama, Chiaki
Format: Journal Article
Language:English
Published: New York Springer US 01.01.2014
Springer Nature B.V
Springer Verlag
Subjects:
Algorithms
Artificial Intelligence
Attraction
Basins
Cellular automata
Computer Science
Control
Dynamical systems
Learning
Logic in Computer Science
Logic programming
Machine Learning
Mechatronics
Natural Language Processing (NLP)
Robotics
Simulation and Modeling
Tasks
Learning from interpretation
Supported models
Attractors
Cellular automata
Inductive logic programming
Dynamical systems
Boolean networks
dynamical systems
learning from interpretation
Inductive Logic Programming
supported models
attractors
cellular automata
ISSN:0885-6125, 1573-0565
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ObjectType-Article-1
ObjectType-Feature-2
ISSN:0885-6125
1573-0565
DOI:10.1007/s10994-013-5353-8