## Logic Program Synthesis and TransformationSpringer-Verlag, 1992 - Logic programming |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Logic Program Synthesis via Proof Planning | 1 |

Deductive Synthesis of Programs for Query Answering | 15 |

Synthesis of Narrowing Programs | 30 |

Copyright | |

14 other sections not shown

### Common terms and phrases

abstract interpretation admissible evaluation spaces algorithm applied argument Artiﬁcial ATMS atoms auxiliary deﬁnitions base Bundy Computation Induction consider contains corresponding deductive deﬁned deﬁnition clause denote derivation elimination EOLDT structure EOLDT tree equations equivalent example expression ﬁgure ﬁnd ﬁnite ﬁrst folding formula free variables full Prolog function Functional Programming goal G Horn clauses implementation inference rules inﬁnite input input-output goal intensional answers justiﬁcations label narrowing NFI-driven Induction node obtained operations output partial evaluation predicate symbol problem Proc procedure program synthesis program transformation Prolog programs proof nets proof planning properties pure logic program quantiﬁed query reachability recursive relational algebra relational calculus replace representation residual program result semantics Simpliﬁcation SLD-strict solution table speciﬁcation step strategy Structural Induction subset substitution tableau techniques termination Theorem Transformation Problem TransfP tuple unary unfolding uniﬁcation uniﬁes unnecessary variables valid evaluation veriﬁcation wave rules yields