Otter - The CADE-13 Competition Incarnations

This article discusses the two incarnations of Otter entered in the CADE-13 Automated Theorem Proving System Competition. Also presented are some historical background, a summary of applications that have led to new results in mathematics and logic, and a general discussion of Otter.

[1]  Lawrence J. Henschen,et al.  A New Use of an Automated Reasoning Assistant: Open Questions in Equivalential Calculus and the Study of Infinite Domains , 1984, Artif. Intell..

[2]  William McCune,et al.  Logic Machine Architecture: Kernel Funtions , 1982, CADE.

[3]  William McCune,et al.  33 basic test problems: a practical evaluation of some paramodulation strategies , 1997 .

[4]  Ross A. Overbeek.  A New Class of Automated Theorem-Proving Algorithms , 1974, JACM.

[5]  William McCune,et al.  Experiments with discrimination-tree indexing and path indexing for term retrieval , 1992, Journal of Automated Reasoning.

[6]  William McCune,et al.  Automated discovery of new axiomatizations of the left group and right group calculi , 1992, Journal of Automated Reasoning.

[7]  William McCune,et al.  Automated Deduction in Equational Logic and Cubic Curves , 1996, Lecture Notes in Computer Science.

[8]  Geoff Sutcliffe,et al.  The Results - of the CADE-13 ATP System Competition , 2004, Journal of Automated Reasoning.

[9]  Larry Wos,et al.  The kernel strategy and its use for the study of combinatory logic , 1993, Journal of Automated Reasoning.

[10]  W. McCune.  A Davis-Putnam program and its application to finite-order model search: Quasigroup existence problems , 1994 .

[11]  Thomas Jech.  OTTER experiments in a system of combinatory logic , 2004, Journal of Automated Reasoning.

[12]  Brian T. Smith.  Reference Manual for the Environmental Theorem Prover: an Incarnation of AURA , 1988 .

[13]  Ross A. Overbeek,et al.  Formula databases for high-performance resolution/paramodulation systems , 2004, Journal of Automated Reasoning.

[14]  William McCune,et al.  Single Axioms for the Left Group and the Right Group Calculi , 1992, Notre Dame J. Formal Log..

[15]  E. L. Lusk,et al.  Semigroups, antiautomorphisms, and involutions: a computer solution to an open problem. I , 1981 .

[16]  Kenneth Kunen,et al.  Single axioms for odd exponent groups , 2004, Journal of Automated Reasoning.

[17]  William McCune,et al.  Single identities for ternary Boolean algebras , 1995 .

[18]  Larry Wos,et al.  Problems and Experiments for and with Automated Theorem-Proving Programs , 1976, IEEE Transactions on Computers.

[19]  George A. Robinson,et al.  Paramodulation and set of support , 1970 .

[20]  Larry Wos,et al.  The Concept of Demodulation in Theorem Proving , 1967, JACM.

[21]  Larry Wos.  Searching for circles of pure proofs , 2004, Journal of Automated Reasoning.

[22]  Steven K. Winker.  Generation and Verification of Finite Models and Counterexamples Using an Automated Theorem Prover Answering Two Open Questions , 1982, JACM.

[23]  William McCune,et al.  Single axioms for groups and Abelian groups with various operations , 1993, Journal of Automated Reasoning.

[24]  Larry Wos,et al.  Experiments in Automated Deduction with Condensed Detachment , 1992, CADE.

[25]  William McCune,et al.  Experiments with ROO: A Parallel Automated Deduction System , 1990, Dagstuhl Seminar on Parallelization in Inference Systems.

[26]  Kenneth Kunen.  Single axioms for groups , 2004, Journal of Automated Reasoning.

[27]  Larry Wos,et al.  OTTER and the Moufang identity problem , 1996, Journal of Automated Reasoning.

[28]  W. McCuney.  Automated Reasoning about Cubic Curves , 1993 .

[29]  William McCune,et al.  Computer and Human Reasoning: Single Implicative Axioms for Groups and for Abelian Groups , 1996 .

[30]  Kenneth Kunen,et al.  The shortest single axioms for groups of exponent 4 , 1995 .

[31]  William McCune,et al.  Single identities for lattice theory and for weakly associative lattices , 1995 .

[32]  Larry Wos,et al.  Efficiency and Completeness of the Set of Support Strategy in Theorem Proving , 1965, JACM.

[33]  L. Wos,et al.  The unit preference strategy in theorem proving , 1899, AFIPS '64 (Fall, part I).

[34]  R. Overbeek,et al.  A tutorial on the construction of high-performance resolution/paramodulation systems , 1990 .

[35]  Rick Stevens,et al.  Automated Reasoning Contributed to Mathematics and Logic , 1990, CADE.

[36]  Ross A. Overbeek,et al.  Complexity and related enhancements for automated theorem-proving programs , 1976 .

[37]  Larry Wos,et al.  Application of Automated Deduction to the Search for Single Axioms for Exponent Groups , 1992, LPAR.

[38]  William McCune,et al.  ITP at Argonne National Laboratory , 1986, CADE.

[39]  Larry Wos.  The power of combining resonance with heat , 2004, Journal of Automated Reasoning.

[40]  Larry Wos,et al.  The Absence and the Presence of Fixed Point Combinators , 1991, Theor. Comput. Sci..

[41]  William McCune,et al.  Single identities for lattice theory and for weakly associative lattices , 1996 .

[42]  William McCune,et al.  OTTER 3.0 Reference Manual and Guide , 1994 .

[43]  Steven K. Winker,et al.  Robbins algebra: Conditions that make a near-boolean algebra boolean , 1990, Journal of Automated Reasoning.

[44]  Kenneth Kunen,et al.  Quasigroups, Loops, and Associative Laws , 1996 .

[45]  William McCune,et al.  Paths to High-Performance Automated Theorem Proving , 1986, CADE.