Abstract is missing.
- Logic Program Synthesis via Proof PlanningIna Kraan, David A. Basin, Alan Bundy. 1-14
- Deductive Synthesis of Programs for Query AnsweringDaniele Nardi, Riccardo Rosati. 15-29
- Synthesis of Narrowing ProgramsCarlos Loría-Sáenz. 30-45
- A Unifying View of Structural Induction and Computation Induction for Logic ProgramsLaurent Fribourg, Hans Olsén. 46-60
- Proof NetsMario Ornaghi. 61-79
- The LOPS Approach: A Transformational Point of View (Extended Abstract)Gerd Neugebauer. 80-81
- Best-first Strategies for Incremental Transformations of Logic ProgramsMaurizio Proietti, Alberto Pettorossi. 82-98
- Deriving Transformations for Logic Programs Using Abstract InterpretationDmitri Boulanger, Maurice Bruynooghe. 99-117
- A Rationalisation of the ATMS in Terms of Partial EvaluationEvelina Lamma, Paola Mello. 118-131
- Deletion of Redundant Unary Type Predicates from Logic ProgramsJohn P. Gallagher, D. Andre de Waal. 151-167
- Automatic Termination AnalysisKristof Verschaetse, Stefaan Decorte, Danny De Schreye. 168-183
- Applications of Unfolding in Prolog ProgrammingJohn Jones. 184-198
- Logimix: A Self-Applicable Partial Evaluator for PrologTorben Æ. Mogensen, Anders Bondorf. 214-227
- Towards Optimization of Full Prolog Programs Guided by Abstract InterpretationAnne Parrain, Philippe Devienne, Patrick Lebègue. 228-241
- On the Transformation of a Prolog Program to a More Efficient Binary ProgramBart Demoen. 242-252
- Efficient Compilation of Lazy Narrowing into PrologJosé André Jimènez-Martin, Julio Moriño-Carballo, Juan José Moreno-Navarro. 253-270