Programming by Demonstration in DLProlog

TL;DR: In this work, some of the features of a PBD system under construction are presented that does not rely on function composition but in the step by step construction of a program automaton.

Abstract: Traditionally computer programming has been conducted as a long lasting cycle of coding, testing and debugging. In comparison, in programming by demonstration (PBD), a system automatically attempts to construct a program that produces the same input-output pairs given as examples by a demonstrator. Unfortunately, in most PBD systems this automatic program construction process has been approached by nding the proper composition of simpler functions searched from a basic set. The exponential computational costs of such searches makes this approach impractical except for a few domains (i.e. text processing) in which some demonstrator's clues can be used to dramatically reduce the search space. In this work, some of the features of a PBD system under construction are presented that does not rely on function composition but in the step by step construction of a program automaton. The automaton is described in DLProlog, a dynamic logic modal extension of pure Prolog. DLProlog allows to represent the automaton states as user dened