Abstract is missing.
- Proving and RewritingJoseph A. Goguen. 1-24
- Proving Correctness wrt Specifications with Hidden PartsJordi Farrés-Casals. 25-39
- Hybrid Implementations of Algebraic SpecificationsH. R. Walters. 40-54
- Multi-Modal Logic Programming using Equational and Order-Sorted LogicFrançoise Debart, Patrice Enjalbert, Madeleine Lescot. 55-69
- Logic Programs with Equational Type Specifications (Extended Abstract)Michael Hanus. 70-85
- Higher-Order Order-Sorted AlgebrasZhenyu Qian. 86-100
- Axiomatization of a Functional Logic LanguageFrançois Bronsard, Uday S. Reddy. 101-116
- Fourier Algorithm RevisitedTien Huynh, Catherine Lassez, Jean-Louis Lassez. 117-131
- Fixpoint Techniques for Non-Monotone MapsAïda Batarekh. 132-143
- Domain Theory for Nonmonotonic FunctionsYuli Zhou, Robert Muller. 144-157
- On the strong completion of logic programsPhan Minh Dung. 158-172
- An Equivalence Preserving First Order Unfold/fold Transformation SystemTaisuke Sato. 173-188
- Propositional Calculus Problems in CHIPHelmut Simonis, Mehmet Dincbas. 189-203
- Unfolding and Fixpoint Semantics of Concurrent Constraint Logic ProgramsMaurizio Gabbrielli, Giorgio Levi. 204-216
- Eliminating Negation from Normal Logic ProgramsKanchana Kanchanasut, Peter J. Stuckey. 217-231
- On Logic Programming Interpretations of Dislog: Programming Long-Distance Dependencies in LogicPatrick Saint-Dizier. 232-246
- Recursive Query Processing in Predicate-Goal GraphJia Liang Han. 247-261
- Implementations of Completion by Transition Rules + Control: ORMEPierre Lescanne. 262-269
- A Matching Process Modulo a Theory of Categorical ProductsFrançoise Bellegarde. 270-282
- Equation Solving in Conditional AC-TheoriesNachum Dershowitz, Subrata Mitra, G. Sivakumar. 283-297
- Lazy Narrowing in a Graph MachineJuan José Moreno-Navarro, Herbert Kuchen, Rita Loogen, Mario Rodríguez-Artalejo. 298-317
- An Abstract Concurrent Machine for RewritingNachum Dershowitz, Naomi Lindenstrauss. 318-331
- Applying Term Rewriting Methods to Finite GroupsReinhard Bündgen. 332-346
- Termination Proofs by Multiset Path Orderings Imply Primitive Recursive Derivation LengthsDieter Hofbauer. 347-358
- Optimization of Rewriting and Complexity of RewritingKe Li. 359-371
- AC-Termination of Rewrite Systems: A Modified Knuth-Bendix OrderingJoachim Steinbach. 372-386