Abstract is missing.
- Refining Specifications to Logic ProgramsIan J. Hayes, R. G. Nickson, Paul A. Strooper. 1-19
- Symbolic Verification with Gap-Order ConstraintsLaurent Fribourg, Julian Richardson. 20-37
- Specification-Based Automatic Verification of Prolog ProgramsAgostino Cortesi, Baudouin Le Charlier, Sabina Rossi. 38-57
- Logic Program Specialisation: How to Be More Specific (Abstract)Michael Leuschel, Danny De Schreye. 58
- Conjunctive Partial Deduction in PracticeJesper Jørgensen, Michael Leuschel, Bern Martens. 59-82
- Redundant Argument Filtering of Logic ProgramsMichael Leuschel, Morten Heine Sørensen. 83-103
- Replacement Can Preserve TerminationAnnalisa Bossi, Nicoletta Cocco. 104-129
- A Transformation Tool for Pure Prolog ProgramsJacob Brunekreef. 130-145
- Enhancing Partial Deduction via Unfold/Fold RulesAlberto Pettorossi, Maurizio Proietti, Sophie Renault. 146-168
- Abstract Specialization and Its Application to Program ParallelizationGermán Puebla, Manuel V. Hermenegildo. 169-186
- Reductions of Petri Nets and Unfolding of Propositional Logic ProgramsLaurent Fribourg, Hans Olsén. 187-203
- Inferring Argument Size Relationships with CLP(R)Florence Benoy, Andy King. 204-223
- Typed Norms for Typed Logic ProgramsJonathan C. Martin, Andy King, Paul Soper. 224-238
- Partial Deduction in the Framework of Structural Synthesis of ProgramsMihhail Matskin, Henryk Jan Komorowski, John Krogstie. 239-255
- Extensible Logic Program SchemataTimothy S. Gegg-Harrison. 256-274
- Specialising Meta-level Compositions of Logic ProgramsAntonio Brogi, Simone Contiero. 275-294
- Forms of Logic Specifications: A Preliminary StudyKung-Kiu Lau, Mario Ornaghi. 295-312
- Synthesis of Proof Procedures for Default ReasoningPhan Minh Dung, Robert A. Kowalski, Francesca Toni. 313-324