Edinburgh Research Explorer

The Synthesis of Logic Programs from Inductive Proofs

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Related Edinburgh Organisations

Open Access permissions

Open

Documents

Original languageEnglish
Title of host publicationComputational Logic
Subtitle of host publicationSymposium Proceedings, Brussels, November 13/14, 1990
EditorsJ. Lloyd
PublisherSpringer Berlin Heidelberg
Pages135-149
Number of pages15
ISBN (Electronic)978-3-642-76274-1
ISBN (Print)978-3-642-76276-5
DOIs
StatePublished - 1990

Publication series

NameESPRIT Basic Research Series
PublisherSpringer Berlin / Heidelberg

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.

Download statistics

No data available

ID: 142011