Front matter
1-20
Attempto Controlled English — Not Just Another Logic Specification Language
Norbert E. Fuchs, Uta Schwertel and Rolf Schwitter
21-40
A Step Towards a Methodology for Mercury Program Construction: A Declarative Semantics for Mercury
Dante Baldan, Baudouin Le Charlier, Christophe Leclère and Isabelle Pollet
41-60
Pragmatics in the Synthesis of Logic Programs
David Robertson and Jaume Agustí
61-80
Using Decision Procedures to Accelerate Domain-Specific Deductive Synthesis Systems
Jeffrey Van Baalen and Steven Roach
81-100
Synthesis of Programs in Abstract Data Types
Alessandro Avellone, Mauro Ferrari and Pierangelo Miglioli
101-123
OOD Frameworks in Component-Based Software - Development in Computational Logic
Kung-Kiu Lau and Mario Ornaghi
124-142
The Use of Renaming in Composing General Programs
Antonio Brogi, Simone Contiero and Franco Turini
143-158
Inductive Synthesis of Logic Programs by Composition of Combinatory Program Schemes
Andreas Hamfelt and Jørgen Fischer Nilsson
159-178
Specialising Logic Programs with Respect to Call/Post Specifications
Annalisa Bossi and Sabina Rossi
179-198
Generalization in Hierarchies of Online Program Specialization Systems
Robert Glück, John Hatcliff and Jesper Jørgensen
199-218
Improving Homeomorphic Embedding for Online Termination
Michael Leuschel
219-239
Successes in Logic Programs
Annalisa Bossi and Nicoletta Cocco
240-254
Inferring and Compiling Termination for Constraint Logic Programs
Sébastien Hoarau and Fred Mesnard
255-270
Strictness Analysis as Finite-Domain Constraint Solving
Tihomir Gabrić, Kevin Glynn and Harald Søndergaard
271-288
Invariant Discovery via Failed Proof Attempts
Jamie Stark and Andrew Ireland
289-307
Preventing Instantiation Errors and Loops for Logic Programs with Multiple Modes Using block Declarations
Jan-Georg Smaus, Pat Hill and Andy King
308
Algorithms for Synthesizing Reactive Systems: A Perspective
Pierre Wolper
309-312
Schema-Guided Synthesis of CLP Programs
Hamza Zidoum, Pierre Flener and Brahim Hnich
313-315
Abstract: Proof Planning with Program Schemas
Julian Richardson
316-318
Logical Synthesis of Imperative O.O. Programs
Patrick Bellot and Bernard Robinet
319-321
Mathematical Foundations for Program Transformations
R. Ben Ayed, J. Desharnais, M. Frappier and A. Mili
322-324
An Exhaustive-Search Method Using Layered Streams Obtained Through a Meta-Interpreter for Chain Programs
David A. Rosenblueth
325-327
Bottom-Up Specialisation of Logic Programs
Wim Vanhoof, Danny De Schreye and Bern Martens
328-330
Myrtle: A Set-Oriented Meta-Interpreter Driven by a “Relational” Trace for Deductive Databases Debugging
Sarah Mallet and Mireille Ducassé
Back matter