Abstract is missing.
- A Biographical Sketch of W. W. BledsoeAnne Olivia Boyer, Robert S. Boyer. 1-30
- Subsumption, a Sometimes Undervalued ProcedureLarry Wos, Ross A. Overbeek, Ewing L. Lusk. 3-40
- METEORs: High Performance Theorem Provers Using Model EliminationOwen L. Astrachan, Donald W. Loveland. 31-60
- The Markgraf Karl Refutation ProcedureHans Jürgen Ohlbach, Jörg H. Siekmann. 41-112
- The Metatheorist: Automatic Proofs of Theorems in Analysis Using Non-Standard Techniques, Part IIA. Michael Ballantyne. 61-76
- Perspectives on Automated DeductionWolfgang Bibel. 77-104
- MJRTY: A Fast Majority Vote AlgorithmRobert S. Boyer, J. Strother Moore. 105-118
- Modal Logic Should Say More Than It DoesMelvin Fitting. 113-135
- How the Brain Adjusts Synapses - MaybeHans J. Bremermann, Russell W. Anderson. 119-148
- Interactive Proof PresentationW. W. Bledsoe. 136-165
- The Use of Proof Plans for NormalizationAlan Bundy. 149-166
- Intelligent Backtracking RevistedMaurice Bruynooghe. 166-177
- What are the Limitations of the Situation Calculus?Michael Gelfond, Vladimir Lifschitz, Arkady Rabinov. 167-180
- A Science of ReasoningAlan Bundy. 178-198
- Reasoning in Paraconsistent LogicsJames J. Lu, Lawrence J. Henschen, V. S. Subrahmanian, Newton C. A. da Costa. 181-210
- Inductive Inference of Theories from FactsEhud Y. Shapiro. 199-254
- Compiling Recursive Functional Prolog Programs with List Structure into Procedural LanguagesYoung K. Nam, Lawrence J. Henschen. 211-230
- Aligning Multiple RNA SequencesRoss A. Overbeek, Ian T. Foster. 231-248
- Similarity, Uncertainty and Case-Based Reasoning in PatdexMichael M. Richter, Stefan Wess. 249-266
- Solving Equations in Abstract Algebras: A Rule-Based Survey of UnificationJean-Pierre Jouannaud, Claude Kirchner. 257-321
- Formal and Informal ProofsJohn Alan Robinson. 267-282
- PTTP and Linked InferenceMark E. Stickel. 283-296
- Automated Reasoning and Bledsoe s Dream for the FieldLarry Wos. 297-345
- Disunification: A SurveyHubert Comon. 322-359
- A Case Study of the Completion Procedure: Proving Ring Commutativity ProblemsDeepak Kapur, Hantao Zhang. 360-394
- Computations in Orthogonal Rewriting Systems, IGérard P. Huet, Jean-Jacques Lévy. 395-414
- Computations in Orthogonal Rewriting Systems, IIGérard P. Huet, Jean-Jacques Lévy. 415-443
- Unification and ML-Type ReconstructionParis C. Kanellakis, Harry G. Mairson, John C. Mitchell. 444-478
- Automatic Dimensional InferenceMitchell Wand, Patrick O Keefe. 479-483
- Logic-Programming Schemes and Their ImplementationKeith L. Clark. 487-541
- A Near-Horn Prolog for CompilationDonald W. Loveland, David W. Reed. 542-564
- Unfold/Fold Transformations of Logic ProgramsP. A. Gardner, John C. Shepherdson. 565-583
- An Algebraic Representation of Logic-Program ComputationsAndrea Corradini, Ugo Montanari. 584-612
- Theory of Disjunctive Logic ProgramsJack Minker, Arcot Rajasekar, Jorge Lobo. 613-639
- Bottom-Up Evaluation of Logic ProgramsJeffrey F. Naughton, Raghu Ramakrishnan. 640-700
- Absys, the First Logic-Programming Language: A View of the Inevitability of Logic ProgrammingE. W. Elcock. 701-721