Results 1 
8 of
8
Otter: The CADE13 Competition Incarnations
 JOURNAL OF AUTOMATED REASONING
, 1997
"... This article discusses the two incarnations of Otter entered in the CADE13 Automated Theorem Proving 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. ..."
Abstract

Cited by 57 (3 self)
 Add to MetaCart
(Show Context)
This article discusses the two incarnations of Otter entered in the CADE13 Automated Theorem Proving 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.
OTTER experiments in a system of combinatory logic
 Journal of Automated Reasoning
, 1995
"... Abstract. This paper describes some experiments involving the automated theoremproving program OTTER in the system TRC of illative combinatory logic. We show how OTTER can be steered to find a contradiction in an inconsistent variant of TRC, and present some experimentally discovered identities in T ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
(Show Context)
Abstract. This paper describes some experiments involving the automated theoremproving program OTTER in the system TRC of illative combinatory logic. We show how OTTER can be steered to find a contradiction in an inconsistent variant of TRC, and present some experimentally discovered identities in TRC. 1. Introduction. OTTER [5] is a resolution/paramodulation theoremproving program for firstorder logic with equality. It has been used successfully in several areas of logic and algebra [8], [9], [6], [7], [4]. In this paper we describe our experiments with OTTER in the system TRC
A New Method for Automated Finite Model Building Exploiting Failures and Symmetries
, 1998
"... . A method for building finite models is proposed. It combines enumeration of the set of interpretations on a finite domain with strategies in order to prune significantly the search space. The main new ideas underlying our method are to benefit from symmetries and from the information extracted fro ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
. A method for building finite models is proposed. It combines enumeration of the set of interpretations on a finite domain with strategies in order to prune significantly the search space. The main new ideas underlying our method are to benefit from symmetries and from the information extracted from the structure of the problem and from failures of model verification tests. The algorithms formalizing the approach are given and the standard properties (termination, completeness, and soundness) are proven. The method can deal with firstorder logic with equality. In contrast to existing ones, it does not require to transform the initial problem into a normal form and can be easily extended to other logics. Experimental results and comparisons with related works are reported. 1. Introduction The capital importance of the notion of "model" in Logic was naturally inherited by Automated Deduction, where, since the very beginning, the use of models has been recognized as an useful technique...
The power of combining resonance with heat
 J. Automated Reasoning
, 1996
"... In this article, I present experimental evidence of the value of combining two strategies each of which has proved powerful in various contexts. The resonance strategy gives preference (for directing a program’s reasoning) to equations or formulas that have the same shape (ignoring variables) as one ..."
Abstract

Cited by 6 (5 self)
 Add to MetaCart
In this article, I present experimental evidence of the value of combining two strategies each of which has proved powerful in various contexts. The resonance strategy gives preference (for directing a program’s reasoning) to equations or formulas that have the same shape (ignoring variables) as one of the patterns supplied by the researcher to be used as a resonator. The hot list strategy rearranges the order in which conclusions are drawn, the rearranging caused by immediately visiting and, depending on the value of the heat parameter, even immediately revisiting a set of input statements chosen by the researcher; the chosen statements are used to complete applications of inference rules rather than to initiate them. Combining these two strategies often enables an automated reasoning program to attack deep questions and hard problems with far more effectiveness than using either alone. The use of this combination in the context of cursory proof checking produced most unexpected and satisfying results, as I show here. I present the material (including commentary) in the spirit of excerpts from an experimenter’s notebook, thus meeting the frequent request to illustrate how a researcher can make wise choices from among the numerous options offered by McCune’s automated reasoning program OTTER. I include challenges and topics for research and, to aid the researcher, in the Appendix a sample input
The Flowering of Automated Reasoning
, 2001
"... This article celebrates with obvious joy the role automated reasoning now plays for mathematics and logic. Simultaneously, this article evidences the realization of a dream thought impossible just four decades ago by almost all. But there were believers, including Joerg Siekmann to whom this article ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
This article celebrates with obvious joy the role automated reasoning now plays for mathematics and logic. Simultaneously, this article evidences the realization of a dream thought impossible just four decades ago by almost all. But there were believers, including Joerg Siekmann to whom this article is dedicated in honor of his sixtieth birthday. Indeed, today (in the year 2001)...
Automated Equational Deduction with Otter
, 1995
"... Contents 1 Introduction 1 2 Otter and MACE 3 2.1 Otter : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 3 2.1.1 Notes on Otter Proof Notation : : : : : : : : : : : : : : : 3 2.2 MACE : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 3 2 Test Chapter 3 3 Lattices a ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Contents 1 Introduction 1 2 Otter and MACE 3 2.1 Otter : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 3 2.1.1 Notes on Otter Proof Notation : : : : : : : : : : : : : : : 3 2.2 MACE : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 3 2 Test Chapter 3 3 Lattices and Latticelike Structures 9 4 The Rule (gL) 23 4.1 Problems : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 23 4.2 Sample Figures : : : : : : : : : : : : : : : : : : : : : : : : : : : : 44 5 Quasigroups 51 6 Semigroups 57 6.1 A Conjecture of Padmanabhan : : : : : : : : : : : : : : : : : : : 57 7 Groups 69 7.1 SelfDual Bases for Group Theory : : : : : : : : : : : : : : : : : 69 8 TC and RC 73 9 Problems not yet placed in the proper chapter 83 iii iv CONTENTS List
The Automation of Sound Reasoning and Successful Proof Finding
"... created 092499 revised last 05022000 delim $$ ..."