The University of Edinburgh -
Division of Informatics
Forrest Hill & 80 South Bridge

Research Paper #501

Title:The Synthesis of Logic Programs from Inductive Proofs
Authors:Bundy,A; Smaill,AD; Wiggins,G
Date: 1990
Presented:To appear in the Proceedings of the Esprit Symposium on Computational Logic, November 1990
Abstract:We describe a technique for synthesising logic (Prolog) programs from non-executable specifications. This technique is adapted from one for synthesising functional programs as total functions. Logic programs, on the other hand, define predicates. They can be run in different input modes, they sometimes produce multiple outputs and sometimes none. They may not terminate. The key idea of the adaptation is that a predicate is a total function in the all-ground mode, i.e. when all its arguments are inputs (pred(+,...,+) in Prolog notation). The program is synthesised as a function in this mode and then run in other modes. To make the technique work it is necessary to synthesise pure logic programs, without the closed world assumption, and then compile these into Prolog programs. The technique has been tested on the OYSTER (functional) program development system.

[Search These Pages] [DAI Home Page] [Comment]