Abstract is missing.
- Concurrent Constraint ProgrammingCatuscia Palamidessi. 1-2
- Specifications Using Multiple-Conclusion Logic ProgramsDale Miller. 3-4
- Viewing A program Transformation System At WorkRobert Paige. 5
- Proving Implications by Algebraic ApproximationMichael Codish, Grigory Mashevitzky. 6-22
- Sufficient Completeness and Parameterized Proofs by InductionAdel Bouhoula. 23-40
- Proving Behavioural Theorems with Standard First-Order LogicMichel Bidoit, Rolf Hennicker. 41-58
- How to Realize LSE NarrowingAndreas Werner, Alexander Bockmayr, Stefan Krischer. 59-76
- Compositional Analysis for Equational Horn ProgramsMaría Alpuente, Moreno Falaschi, Germán Vidal. 77-94
- Equation Solving in Projective Planes and Planar Ternary RingsPhilippe Balbiani. 95-113
- From Eventual to Atomic Locally Atomic CC Programs: A Concurrent SemanticsFrancisco Bueno, Manuel V. Hermenegildo, Ugo Montanari, Francesca Rossi. 114-132
- Concurrent Logic Programming as Uniform Linear ProofsPaolo Volpe. 133-149
- Three-Valued Completion for Abductive Logic ProgramsFrank Teusink. 150-167
- A Sequential Reduction StrategySergio Antoy, Aart Middeldorp. 168-185
- On Modularity of Termination and Confluence Properties of Conditional Rewrite SystemsBernhard Gramlich. 186-203
- Syntactical Analysis of Total TerminationMaria C. F. Ferreira, Hans Zantema. 204-222
- Logic Programs as term Rewriting SystemsMassimo Marchiori. 223-241
- Higher-Order Minimal Functional GraphsNeil D. Jones, Mads Rosendahl. 242-252
- Reasoning about Layered, Wildcard and Product PatternsDelia Kesner. 253-268
- Preserving Universal Termination through Unfold/FoldAnnalisa Bossi, Nicoletta Cocco. 269-286
- A Logic for Variable Aliasing in Logic ProgramsElena Marchiori. 287-304