Computational logic : essays in honor of Alan Robinson


Computational logic : essays in honor of Alan Robinson

edited by Jean-Louis Lassez and Gordon Plotkin

MIT Press, c1991

大学図書館所蔵 件 / 37



Includes bibliographical references



Reflecting Alan Robinson's fundamental contribution to computational logic, this book brings together seminal papers in inference, equality theories, and logic programming. It is an exceptional collection that ranges from surveys of major areas to new results in more specialized topics. Contents Inference * Subsumption, A Sometimes Undervalued Procedure, Larry Wos, Ross Overbeek, and Ewing Lusk * The Markgraf Karl Refutation Procedure, Hans Jurgen Ohlbach and Joerg 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 * Equality. Solving Equations in Abstract Algebras: A Rule-based Survey of Unification, Jean-Pierre Jouannaud and Claude Kirchner * Disunification: A 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, Girard Huet and JeanJacques Levy * Unification and ML Type Reconstruction, Paris Kanellakis, Harry Mairson, and John Mitchell * Automatic Dimensional Analysis, Mitchell Wand * 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, Arcot Rajasekar, and Jorge Lobo * Bottom-Up Evaluation of Logic Programs, Jeffrey Naughton and Raghu Ramakrishnan * Absys, the First Logic Programming Language: A View of the Inevitability of Logic Programming, E. W. Elcock


  • 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.

「Nielsen BookData」 より