A Scheme-Driven Approach to Learning Programs from Input/Output Equations

02/04/2018
by   Jochen Burghardt, et al.
0

We describe an approach to learn, in a term-rewriting setting, function definitions from input/output equations. By confining ourselves to structurally recursive definitions we obtain a fairly fast learning algorithm that often yields definitions close to intuitive expectations. We provide a Prolog prototype implementation of our approach, and indicate open issues of further investigation.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/09/2019

Input-output equations and identifiability of linear ODE models

Structural identifiability is a property of a differential model with pa...
research
05/03/2023

Input-Output Feedback Linearization Preserving Task Priority for Multivariate Nonlinear Systems Having Singular Input Gain Matrix

We propose an extension of the input-output feedback linearization for a...
research
07/28/2020

Parameter identifiability and input-output equations

Structural parameter identifiability is a property of a differential mod...
research
03/29/2023

On real and observable realizations of input-output equations

Given a single algebraic input-output equation, we present a method for ...
research
07/25/2022

Evolving Recursive Definitions with Applications to Dynamic Programming

Inspired by computability logic<cit.>, we refine recursive function defi...
research
01/03/2022

let (rec) insertion without Effects, Lights or Magic

Let insertion in program generation is producing code with definitions (...
research
08/09/2016

Canonical Correlation Inference for Mapping Abstract Scenes to Text

We describe a technique for structured prediction, based on canonical co...

Please sign up or login with your details

Forgot password? Click here to reset