Abstract is missing.
- Towards the Synthesis of Constraint Propagation AlgorithmsDouglas R. Smith. 1-9
- A Formal View of Specification, Deductive Synthesis and Transformation of Logic ProgramsKung-Kiu Lau, Mario Ornaghi. 10-31
- Reachability Analysis for the Extension Procedure - A Topological ResultGerd Neugebauer. 32-44
- Inductive Synthesis of Logic Programs and Inductive Logic ProgrammingFrancesco Bergadano, Daniele Gunetti. 45-56
- Induction of Prolog Programs with MarkusMarko Grobelnik. 57-63
- A General Technique for Automatically Generating Efficient Programs Through the Use of Proof Planning (Abstract)Peter Madden, Jane Hesketh, Ian Green, Alan Bundy. 64-66
- Guiding Synthesis ProofsVincent Lombart, Geraint A. Wiggins, Yves Deville. 67-81
- Combining Prolog Programs in a Techniques Editing System (Abstract)Maria Vargas-Vera, David Stuart Robertson, Robert Inder. 82-84
- Designing Prolog Programming TechniquesWamberto Weber Vasconcelos. 85-99
- Interactive Program Derivation Using Program Schemata and Incrementally Generated StrategiesAnna-Lena Johansson. 100-112
- The Power of Partial EvaluationD. Andre de Waal. 113-123
- Specialising the Ground Representation in the Logic Programming Language GödelCorin A. Gurr. 124-140
- Synthesis of Programs from Unfold/Fold ProofsMaurizio Proietti, Alberto Pettorossi. 141-158
- Some Further Issues in Finite Unfolding (Abstract)Bern Martens, Danny De Schreye. 159-161
- A Transformation Based in the Equality Between TermsUlrich Neumerkel. 162-176
- Automatic Exploitation of Non-Determinate Independent And-Parallelism in the Basic Andorra ModelM. Olmedilla, Francisco Bueno, Manuel V. Hermenegildo. 177-195
- Memoing with Abstract Answers and Delphi LemmasPaul Tarau, Koenraad De Bosschere. 196-209
- Using Abstract Interpretation for Goal ReplacementDmitri Boulanger, Maurice Bruynooghe. 210-228
- Mechanical Transformation of Logic Definitions Augmented with Type Information into Prolog Procedures: Some ExperimentsPierre De Boeck, Baudouin Le Charlier. 229-245