Logic Program Synthesis and Transformation

Chapter 1 Toward the Synthesis of Constraint Propagation Algorithms

Chapter 2 A Formal View of Specification, Deductive Synthesis and Transformation of Logic Programs

Chapter 3 Reachability Analysis for the Extension Procedure — A Topological Result —

Chapter 4 Inductive Synthesis of Logic Programs and Inductive Logic Programming

Chapter 5 Induction of Prolog programs with Markus

Chapter 6 A General Technique for Automatically Generating Efficient Programs Through the Use of Proof Planning (Abstract)

Chapter 7 Guiding Synthesis Proofs

Chapter 8 Combining Prolog Programs in a Techniques Editing System (Abstract)

Chapter 9 Designing Prolog Programming Techniques

Chapter 10 Interactive Program Derivation Using Program Schemata and Incrementally Generated Strategies

Chapter 11 The Power of Partial Evaluation

Chapter 12 Specialising the Ground Representation in the Logic Programming Language Gödel

Chapter 13 Synthesis of Programs from Unfold/Fold Proofs

Chapter 14 Some Further Issues in Finite Unfolding (Abstract)

Chapter 15 A Transformation Based on the Equality between Terms

Chapter 16 Automatic Exploitation of Non-Determinate Independent And-Parallelism in the Basic Andorra Model

Chapter 17 Memoing with Abstract Answers and Delphi Lemmas

Chapter 18 Using Abstract Interpretation for Goal Replacement

Chapter 19 Mechanical Transformation of Logic Definitions augmented with Type Information into Prolog Procedures: Some Experiments