Logic Program Synthesis and Transformation - Meta-Programming in Logic: 4th International Workshops, LOPSTR '94 and META '94, Pisa, Italy, June 20 - 21, 1994. Proceedings / Edition 1

by Laurent Fribourg, Franco Turini

Overview

This volume constitutes the combined proceedings of the 4th International Workshops on Logic Program Synthesis and Transformation (LOPSTR '94) and on Meta-Programming

(META '94), held jointly in Pisa, Italy in June 1994.

This book includes thoroughly revised versions of the best papers presented at both workshops. The main topics addressed by the META papers are language extensions in support of meta-logic, semantics of meta-logic, implementation of meta-logic features, performance of meta-logic, and several applicational aspects. The LOPSTR papers are devoted to unfolding/folding, partial deduction, proofs as programs, inductive logic programming, automated program verification, specification and programming methodologies.

Product Details

ISBN-13:	9783540587927
Publisher:	Springer Berlin Heidelberg
Publication date:	12/13/1994
Series:	Lecture Notes in Computer Science , #883
Edition description:	1994
Pages:	458
Product dimensions:	6.10(w) x 9.20(h) x 1.10(d)

Table of Contents

Logic frameworks for logic programs.- An extended transformation system for CLP programs.- Using call/exit analysis for logic program transformation.- A transformation system for definite programs based on termination analysis.- On the use of inductive reasoning in program synthesis: Prejudice and prospects.- Transforming specifications of observable behaviour into programs.- On specification frameworks and deductive synthesis of logic programs.- Partial evaluation of the “real thing”.- Schema-based top-down design of logic programs using abstract data types.- Generalizing extended execution for normal programs.- Partial deduction of disjunctive logic programs: A declarative approach.- Avoiding non-termination when learning logic programs: A case study with FOIL and FOCL.- Propagation of inter-argument dependencies in “Tuple-distributive” type inference systems.- Logic programming and logic grammars with first-order continuations.- Improving the Whelk system: A type-theoretic reconstruction.- A model of costs and benefits of meta-level computation.- A basis for a multilevel metalogic programming language.- Logic programs with tests.- An architecture with multiple meta-levels for the development of correct programs.- More on unfold/fold transformations of normal programs: Preservation of fitting's semantics.- Formal semantics of temporal epistemic reflection.- Temporal semantics of meta-level architectures for dynamic control of reasoning.- Gödel as a meta-language for composing logic programs.- A module system for meta-programming.- Building proofs in context.- Introspective metatheoretic reasoning.- Abstract debugging of logic programs.