Journal of Automated Reasoning (JAR), Volume 11

Volume 11, Number 1, August 1993

• Adrian Walker: Backchain Iteration: Towards a Practical Inference Method That Is Simple Enough to Be Proved Terminating, Sound, and Complete. 1-22 BibTeX
• Fausto Giunchiglia, Toby Walsh: The Inevitability of Inconsistent Abstract Spaces. 23-41 BibTeX
• Amy P. Felty: Implementing Tactics and Tacticals in a Higher-Order Logic Programming Language. 41-81 BibTeX
• Alberto Maria Segre, Daniel Scharstein: Bounded-Overhead Caching for Definite-Clause Theorem Proving. 83-113 BibTeX
• Gopalan Nadathur: A Proof Procedure for the Logic of Hereditary Harrop Formulas. 115-145 BibTeX

• Larry Wos: The Problem of Naming and Function Replacement. 147-148 BibTeX

Volume 11, Number 2, October 1993

• Klaus U. Schulz: Wort Unification and Transformation of Generalized Equations. 149-184 BibTeX
• Alexandre Boudet: Competing for the AC-Unification Race. 185-212 BibTeX
• William M. Farmer, Joshua D. Guttman, F. Javier Thayer: IMPS: An Interactive Mathematical Proof System. 213-248 BibTeX
• John Grant, John F. Horty, Jorge Lobo, Jack Minker: View Updates in Stratified Disjunctive Databases. 249-267 BibTeX
• Jinchang Wang: Inference Flexibility in Horn Clause Knowledge Bases and the Simplex Method. 269-288 BibTeX

• Larry Wos: The Problem of Reasoning by Case Analysis. 289-291 BibTeX

Volume 11, Number 3, December 1993

• W. W. Bledsoe, Guohui Feng: Set-Var. 293-314 BibTeX
• Ross A. Overbeek: The CADE-11 Competitions: A Personal View. 315-316 BibTeX
• Ewing L. Lusk, William McCune: Uniform Strategies: The CADE-11 Theorem Proving Contest. 317-331 BibTeX
• Hantao Zhang: Automated Proofs of Equality Problems in Overbeek's Competition. 333-351 BibTeX
• Lawrence C. Paulson: Set Theory for Verification: I. From Foundations to Functions. 353-389 BibTeX
• Sidney C. Bailin, Dave Barker-Plummer: Z-Match: An Inference Rule for Incrementally Elaborating Set Instantiations. 391-428 BibTeX

• Larry Wos: The Problem of Induction. 433-434 BibTeX