Cited By
View all- Sutcliffe G(2006)The CADE-20 automated theorem proving competitionAI Communications10.5555/1162486.116249119:2(173-181)Online publication date: 1-Jan-2006
System Description: SCOTT-5
Pages 443 - 447
Abstract
This paper reports recent experimental work in the development and refinement of the first order theorem prover SCOTT-5. This is descended from the SCOTT (Semantically Constrained OTTER) prover (see Proc. IJCAI 1993, pp. 109-114) and uses the same combination of a saturation-based theorem prover and a finite domain constraint solver, but the architecture of SCOTT-5 is radically different from that of its ancestor. Here we briefly outline semantic guidance as it occurs in SCOTT-5, and give experimental evidence of an improvement in performance (in terms of efficiency) that we attribute to the guidance strategy.
References
[1]
E. Lusk, J. Slaney, and W. McCune. SCOTT: Semantically constrained OTTER (system description). In A. Bundy, editor, Proceedings of 12th International Conference on Automated Deduction , number 814 in Lecture Notes in Artificial Intelligence, pages 764-768, Nancy, France, 1994. Springer-Verlag.
[2]
W.W. McCune. Otter 3.0 reference manual and guide. Technical Report ANL-94/6, Argonne National Laboratory, Argonne, USA, 1994.
[3]
D. Plaisted and Y. Zhu. Ordered semantic hyper linking. In Proceedings of the 14th National Conference on Artificial Intelligence (AAAI-97) , 1997.
[4]
J. R. Slagel. Automatic theorem proving with renamable and semantic resolution. Journal of the ACM , 14(4):687-697, 1967.
[5]
J. Slaney. SCOTT: A Model-Guided Theorem Prover. In R. Bajcsy, editor, Proceedings of the 13th International Conference on Artificial Intelligence , pages 109-114, Chambery, France, 1993. Morgan-Kaufman.
[6]
J. Slaney. Finder: Finite Domain Enumerator (System Description). In A. Bundy, editor, Proceedings of 12th International Conference on Automated Deduction , number 814 in Lecture Notes in Artificial Intelligence, pages 764-768, Nancy, France, 1994. Springer-Verlag.
[7]
J. Slaney and T. Surendonk. Combining finite model generation with theorem proving. In Frontiers of Combining Systems , pages 141-155, 1996.
[8]
L. Wos. Automated Reasoning: 33 Basic Research Problems . Pentice Hall, Englewood Cliffs, NewJersey, 1988.
Index Terms
- System Description: SCOTT-5
Index terms have been assigned to the content through auto-classification.
Recommendations
System Description: Spass Version 3.0
CADE-21: Proceedings of the 21st international conference on Automated Deduction: Automated Deduction<Emphasis Type="SmallCaps">Spass</Emphasis>is an automated theorem prover for full first-order logic with equality and a number of non-classical logics. This system description provides an overview of our recent developments in <Emphasis Type="SmallCaps"...
System Description: Delphin -- A Functional Programming Language for Deductive Systems
Delphin is a functional programming language [Adam Poswolsky and Carsten Schurmann. Practical programming with higher-order encodings and dependent types. In European Symposium on Programming (ESOP), 2008] utilizing dependent higher-order datatypes. ...
MOIN: A Nested Sequent Theorem Prover for Intuitionistic Modal Logics (System Description)
Automated ReasoningAbstractWe present a simple Prolog prover for intuitionistic modal logics based on nested sequent proof systems. We have implemented single-conclusion systems (Gentzen-style) and multi-conclusion systems (Maehara-style) for all logics in the ...
Comments
Information & Contributors
Information
Published In
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 18 June 2001
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 16 Oct 2024
Other Metrics
Citations
Cited By
View all- Sutcliffe G(2006)The CADE-20 automated theorem proving competitionAI Communications10.5555/1162486.116249119:2(173-181)Online publication date: 1-Jan-2006
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in