TPTP, CASC and the development of a semantically guided theorem prover

Authors:
Kahlil Hodgson;John Slaney
Affiliations:
-;(Corresponding author) Computer Sciences Laboratory, RSISE, The Australian National University, Canberra, ACT 0200, Australia E-mail: (kahlil,jks)@csl.anu.edu.au
Venue:
AI Communications - CASC
Year:
2002

Citing 10
Cited 3

Combining enumeration and deductive techniques in order to increase the class of constructible infinite models

Journal of Symbolic Computation - Special issue on advances in first-order theorem proving
The CADE-15 ATP System Competition

Journal of Automated Reasoning
Ordered Semantic Hyper-Linking

Journal of Automated Reasoning
SCOTT: Semantically Constrained Otter System Description

CADE-12 Proceedings of the 12th International Conference on Automated Deduction
FINDER: Finite Domain Enumerator - System Description

CADE-12 Proceedings of the 12th International Conference on Automated Deduction
Experiments in the Heuristic Use of Past Proof Experience

CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
The eXtended Least Number Heuristic

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
System Description: SCOTT-5

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
High performance ATP systems by combining several AI methods

IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
SEM: a system for enumerating models

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1

Semantically guiding a first-order theorem prover with a soft model

AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Semantic guidance for saturation provers

AISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Symbolic Computation
Truthful monadic abstractions

IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

The first-order theorem prover SCOTT has been through a series of versions over some ten years. The successive provers, while retaining the same underlying technology, have used radically different algorithms and shown wide differences of behaviour. The development process has depended heavily on experiments with problems from the TPTP library and has been sharpened by participation in CASC each year since 1997. In the present paper, we outline some of the difficulties inherent in designing and refining a theorem prover as complex as SCOTT, and explain our experimental methodology. While SCOTT is not one of the systems which have been highly optimised for CASC, it does help to illustrate the influence of both CASC and the TPTP library on contemporary theorem proving research.