Results 1  10
of
1,428
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 53 (3 self)
 Add to MetaCart
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.
The Design of the CADE13 ATP System Competition
 Journal of Automated Reasoning, This issue
, 1997
"... . Running a competition for Automated Theorem Proving (ATP) systems is a difficult and arguable venture. However, the potential benefits of such an event by far outweigh the controversial aspects. The motivations for running the CADE13 ATP System Competition were to contribute to the evaluation of ..."
Abstract

Cited by 8 (4 self)
 Add to MetaCart
. Running a competition for Automated Theorem Proving (ATP) systems is a difficult and arguable venture. However, the potential benefits of such an event by far outweigh the controversial aspects. The motivations for running the CADE13 ATP System Competition were to contribute to the evaluation
The Results of the CADE13 ATP System Competition
 Special Issue on the CADE13 Automated Theorem Proving System Competition
, 1997
"... . The CADE13 ATP System Competition tested 18 ATP systems on 50 theorems, in five competition categories, with a time limit of 300 seconds imposed on each system run. This paper records the results of the competition. Some analysis of these results is given, and interesting points are highlighted. ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
. Key words: Automated theorem proving, competition, results 1. Introduction The CADE13 ATP System Competition tested 18 ATP systems on 50 theorems, in five competition categories, with a time limit of 300 seconds imposed on each system run. Full details of the competition design appear in [5
Conclusions about the CADE13 ATP System Competition
, 1997
"... . The CADE13 ATP System Competition was the first large scale controlled competition for 1st order ATP systems. Many people have commented on various aspects of the competition, including some suggestions for future improvement. These comments, and some discussion of them, are contained in this pap ..."
Abstract
 Add to MetaCart
in this paper. An overview of the major issues that will affect future competitions is given. Key words: Automated theorem proving, competition, conclusions 1. Conclusions from the Organizers The CADE13 ATP System Competition was clearly a success. The aims for the competition, as set out in the competition
SETHEO and ESETHEO  The CADE13 Systems
 Journal of Automated Reasoning
, 1997
"... . The model elimination theorem prover SETHEO (version V3.3) and its equational extension ESETHEO are presented. SETHEO employs sophisticated mechanisms of subgoal selection, elaborate iterative deepening techniques, and local failure caching methods. Its equational counterpart ESETHEO transforms ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
formulae containing equality (using a variant of Brand's modification method) and processes the output with the standard SETHEO system. The paper gives an overview of the theoretical background, the system architecture, and the performance of both systems. Key words: Automated theorem proving
1 The CADE20 Automated Theorem Proving Competition
"... The CADE ATP System Competition (CASC) is an annual evaluation of fully automatic, first order Automated Theorem Proving systems. CASC20 was the tenth competition in the CASC series. Seventeen ATP systems and system variants competed in the various competition and demonstration divisions. An outlin ..."
Abstract
 Add to MetaCart
The CADE ATP System Competition (CASC) is an annual evaluation of fully automatic, first order Automated Theorem Proving systems. CASC20 was the tenth competition in the CASC series. Seventeen ATP systems and system variants competed in the various competition and demonstration divisions
1 The IJCAR2004 Automated Theorem Proving Competition
"... The CADE ATP System Competition (CASC) is an annual evaluation of fully automatic, first order Automated Theorem Proving systems – the world championship for such systems. CASCJ2 was the ninth competition in the CASC series. Twentysix ATP systems and system variants competed in the various competi ..."
Abstract
 Add to MetaCart
The CADE ATP System Competition (CASC) is an annual evaluation of fully automatic, first order Automated Theorem Proving systems – the world championship for such systems. CASCJ2 was the ninth competition in the CASC series. Twentysix ATP systems and system variants competed in the various
Theorem Proving with the Real Numbers
, 1996
"... This thesis discusses the use of the real numbers in theorem proving. Typically, theorem provers only support a few `discrete' datatypes such as the natural numbers. However the availability of the real numbers opens up many interesting and important application areas, such as the verification ..."
Abstract

Cited by 119 (13 self)
 Add to MetaCart
This thesis discusses the use of the real numbers in theorem proving. Typically, theorem provers only support a few `discrete' datatypes such as the natural numbers. However the availability of the real numbers opens up many interesting and important application areas, such as the verification
Theorem Proving Modulo
 Journal of Automated Reasoning
"... Abstract. Deduction modulo is a way to remove computational arguments from proofs by reasoning modulo a congruence on propositions. Such a technique, issued from automated theorem proving, is of much wider interest because it permits to separate computations and deductions in a clean way. The first ..."
Abstract

Cited by 111 (18 self)
 Add to MetaCart
Abstract. Deduction modulo is a way to remove computational arguments from proofs by reasoning modulo a congruence on propositions. Such a technique, issued from automated theorem proving, is of much wider interest because it permits to separate computations and deductions in a clean way. The first
Nonlinear Neural Networks: Principles, Mechanisms, and Architectures
, 1988
"... An historical discussion is provided of the intellectual trends that caused nineteenth century interdisciplinary studies of physics and psychobiology by leading scientists such as Helmholtz, Maxwell, and Mach to splinter into separate twentiethcentury scientific movements. The nonlinear, nonstatio ..."
Abstract

Cited by 262 (21 self)
 Add to MetaCart
Schuster models. A Liapunov functional method is described for proving global limit or oscillation theorems for nonlinear competitive systems when their decision schemes are globally consistent or inconsistent, respectively. The former case is illustrated by a model of a globally stable economic market
Results 1  10
of
1,428