Results 1  10
of
18
The TPTP Problem Library
, 1999
"... This report provides a detailed description of the TPTP Problem Library for automated theorem proving systems. The library is available via Internet, and forms a common basis for development of and experimentation with automated theorem provers. This report provides: ffl the motivations for buildin ..."
Abstract

Cited by 100 (6 self)
 Add to MetaCart
This report provides a detailed description of the TPTP Problem Library for automated theorem proving systems. The library is available via Internet, and forms a common basis for development of and experimentation with automated theorem provers. This report provides: ffl the motivations for building the library; ffl a discussion of the inadequacies of previous problem collections, and how these have been resolved in the TPTP; ffl a description of the library structure, including overview information; ffl descriptions of supplementary utility programs; ffl guidelines for obtaining and using the library; Contents 1 Introduction 2 1.1 Previous Problem Collections . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.2 What is Required? . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 2 Inside the TPTP 6 2.1 The TPTP Domain Structure . . . . . . . . . . . . . . . . . . . . . ...
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 44 (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.
A Connectionist Control Component for the Theorem Prover SETHEO
 In ECAI94 Workshop on Combining Symbolic and Connectionist Processing
, 1994
"... Today, the power of automated theorem provers is yet too weak for proving many challinging problems. However heuristics for guiding the proof search can dramatically improve the power of such provers. Since it is very difficult to develop heuristics by hand and since they have to be developed specif ..."
Abstract

Cited by 13 (9 self)
 Add to MetaCart
Today, the power of automated theorem provers is yet too weak for proving many challinging problems. However heuristics for guiding the proof search can dramatically improve the power of such provers. Since it is very difficult to develop heuristics by hand and since they have to be developed specifically for each problem domain (theory), we decided to derive heuristics automatically using machine learning techniques. Especially neural networks seem to be very suitable for the representation of heuristics because of their ability to deal with incomplete and inconsistent knowledge. In the following paper we describe our experiences with a connectionist control component for the theorem prover SETHEO. As SETHEO is very closely related to the programming language Prolog, our work might be of interest for a greater public than just the theorem proving community. 1 Introduction In automated theorem proving the goal is to find a proof for a given theorem automatically, starting from a set o...
A Structured Set of HigherOrder Problems
 Theorem Proving in Higher Order Logics: TPHOLs 2005, LNCS 3603
, 2005
"... Abstract. We present a set of problems that may support the development of calculi and theorem provers for classical higherorder logic. We propose to employ these test problems as quick and easy criteria preceding the formal soundness and completeness analysis of proof systems under development. Ou ..."
Abstract

Cited by 8 (5 self)
 Add to MetaCart
Abstract. We present a set of problems that may support the development of calculi and theorem provers for classical higherorder logic. We propose to employ these test problems as quick and easy criteria preceding the formal soundness and completeness analysis of proof systems under development. Our set of problems is structured according to different technical issues and along different notions of semantics (including Henkin semantics) for higherorder logic. Many examples are either theorems or nontheorems depending on the choice of semantics. The examples can thus indicate the deductive strength of a proof system. 1 Motivation: Test Problems for HigherOrder Reasoning Systems Test problems are important for the practical implementation of theorem provers as well as for the preceding theoretical development of calculi, strategies and heuristics. If the test theorems can be proven (resp. the nontheorems cannot) then they ideally provide a strong indication for completeness (resp. soundness). Examples for early publications providing firstorder test problems are [21,29,23]. For more than decade now the TPTP library [28] has been developed as a systematically structured electronic repository of
Uniform Strategies: The CADE11 Theorem Proving Contest
 Journal of Automated Reasoning
, 1993
"... . At CADE10 Ross Overbeek proposed a twopart contest to stimulate and reward work in automated theorem proving. The first part consists of seven theorems to be proved with resolution, and the second part of equational theorems. Our theorem provers Otter and its parallel child Roo proved all of th ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
. At CADE10 Ross Overbeek proposed a twopart contest to stimulate and reward work in automated theorem proving. The first part consists of seven theorems to be proved with resolution, and the second part of equational theorems. Our theorem provers Otter and its parallel child Roo proved all of the resolution theorems and half of the equational theorems. This paper represents a family of entries in the contest. Key Words. Automated theorem proving, resolution, paramodulation, KnuthBendix completion, strategy. 1 Introduction The Conference on Automated Deduction (CADE) has been for nearly twenty years a meeting where both theoreticians and practitioners present their work. Feeling perhaps that the conference was becoming dominated by the theoreticians, Ross Overbeek proposed at CADE10 in 1990 a contest to stimulate work on the implementation and use of automated theoremproving systems. The challenge was to prove a set of theorems, and do so with a uniform approach. That is, one w...
Proving FirstOrder Equality Theorems with HyperLinking
, 1995
"... Lee and Plaisted recently developed a new automated theorem proving strategy called hyperlinking. As part of his dissertation, Lee developed a roundbyround implementation of the hyperlinking strategy, which competes well with other automated theorem provers on a wide range of theorem proving p ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Lee and Plaisted recently developed a new automated theorem proving strategy called hyperlinking. As part of his dissertation, Lee developed a roundbyround implementation of the hyperlinking strategy, which competes well with other automated theorem provers on a wide range of theorem proving problems. However, Lee's roundbyround implementation of hyperlinking is not particularly well suited for the addition of special methods in support of equality. In this dissertation, we describe, as alternative to the roundbyround hyperlinking implementation of Lee, a smallest instance first implementation of hyperlinking which addresses many of the inefficiencies of roundbyround hyperlinking encountered when adding special methods in support of equality. Smallest instance first hyperlinking is based on the formalization of generating smallest clauses first, a heuristic widely used in other automated theorem provers. We prove both the soundness and logical completeness of smallest instance first hyperlinking and show that it always generates smallest clauses first under
HEUROPA: Heuristic Optimization of Parallel Computations
 In !EuroARCH '93
, 1993
"... . The performance of almost all parallel algorithms and systems can be improved by the use of heuristics that affect the parallel execution. However, since optimal guidance usually depends on many different influences, establishing such heuristics is often difficult. Due to the importance of heurist ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
. The performance of almost all parallel algorithms and systems can be improved by the use of heuristics that affect the parallel execution. However, since optimal guidance usually depends on many different influences, establishing such heuristics is often difficult. Due to the importance of heuristics for optimizing parallel execution, and the similarity of the problems that arise for establishing such heuristics, the HEUROPA activity was founded to attack these problems in a uniform way. To overcome the difficulties of specifying heuristics by hand, machine learning techniques have been employed to obtain heuristics automatically. This paper presents the general approach used for learning heuristics, describes the applications arising in the various subprojects, and provides a detailed case study using the approach for a particular application. 1 Introduction Parallel algorithms represent complex software, with a large number of parameters that need to be adjusted for optimal perfor...
Automated Production of Traditional Proofs in Solid Geometry
"... This paper presents a method of producing readable proofs for theorems in solid geometry. The method is for a class of constructive geometry statements about straight lines, planes, circles, and spheres. The key idea of the method is to eliminate points from the conclusion of a geometric statement u ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper presents a method of producing readable proofs for theorems in solid geometry. The method is for a class of constructive geometry statements about straight lines, planes, circles, and spheres. The key idea of the method is to eliminate points from the conclusion of a geometric statement using several (fixed) high level basic propositions about the signed volumes of tetrahedrons and Pythagoras differences of triangles. We have implemented the algorithm and more than 80 examples from solid geometry have been used to test the program. Our program is efficient and the proofs produced by it are generally short and readable.
Problem Corner: SeventyFive Problems for Testing Automatic Theorem Provers
, 1985
"... The purpose of this note is to provide a graduated selection of problems for use in testing an automatic theorem proving (ATP) system. Included in these problems were the ones I have used in testing my own ATP system (Pelletier 1982, and more recent updates to the system). Some of the problems, espe ..."
Abstract
 Add to MetaCart
The purpose of this note is to provide a graduated selection of problems for use in testing an automatic theorem proving (ATP) system. Included in these problems were the ones I have used in testing my own ATP system (Pelletier 1982, and more recent updates to the system). Some of the problems, especially some of the more difficult ones described at the end of this note, are due to discussions with Len Schubert
Setheo/NN and PIT Evaluation Report
, 1996
"... this report we present the evaluation of the two hybrid reasoning systems Setheo and PIT. The first of the systems, the theorem prover Setheo/NN, is a classical rule based system combined with a sophisticated connectionist network which serves a an evaluation function to guide the search of ..."
Abstract
 Add to MetaCart
this report we present the evaluation of the two hybrid reasoning systems Setheo and PIT. The first of the systems, the theorem prover Setheo/NN, is a classical rule based system combined with a sophisticated connectionist network which serves a an evaluation function to guide the search of