Computational logic: essays in honor of Alan Robinson

Part 1 Inference: subsumption, a sometimes undervalued procedure, Larry Wos et al the Markgraf Karl refutation procedures, Hans Jurgen Ohlbach and Jorg H. Siekmann modal logic should say more than it does, Melvin Fitting interactive proof presentation, W.W. Bledsoe intelligent backtracking revisited, Maurice Bruynooghe a science of reasoning, Alan Bundy inductive inference of theories from facts, Ehud Y. Shapiro. Part 2 Equality: solving equations in abstract algebras - a rule-based survey, Hubert Comon a case study of the completion procedure-proving ring commutativity problems, Deepak Kapur and Hantao Zhang computations in regular rewriting systems I and II, Gerard Huet and Jean-Jacques Levy unification and ML type reconstruction, Paris Kanellakis et al automatic dimensional analysis, Mitchell Wand. Part 3 Logic programming: logic programming schemes and their implementations, Keith Clark a near-horn prolog for compilation, Donald Loveland and David Reed unfold/fold transformations of logic programs, P.A. Gardner and J.C. Shepherdson an algebraic representation of logic program computations, Andrea Corradini and Ugo Montanari theory of disjunctive logic programs, Jack Minker et al bottom-up evaluation of logic programs, Jeffrey Naughton and Raghu Remakrishnan Absys, the first logic programming language - a view of the inevitability of logic programming, E.W. Elcock.