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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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.
W.W. McCune. Otter 3.0 reference manual and guide. Technical Report ANL-94/6, Argonne National Laboratory, Argonne, USA, 1994.
D. Plaisted and Y. Zhu. Ordered semantic hyper linking. In Proceedings of the 14th National Conference on Artificial Intelligence (AAAI-97), 1997.
J. R. Slagel. Automatic theorem proving with renamable and semantic resolution. Journal of the ACM, 14(4):687–697, 1967.
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.
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.
J. Slaney and T. Surendonk. Combining finite model generation with theorem proving. In Frontiers of Combining Systems, pages 141–155, 1996.
L. Wos. Automated Reasoning: 33 Basic Research Problems. Pentice Hall, Englewood Cliffs, New Jersey, 1988.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hodgson, K., Slaney, J. (2001). System Description: SCOTT-5. In: Goré, R., Leitsch, A., Nipkow, T. (eds) Automated Reasoning. IJCAR 2001. Lecture Notes in Computer Science, vol 2083. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45744-5_36
Download citation
DOI: https://doi.org/10.1007/3-540-45744-5_36
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42254-9
Online ISBN: 978-3-540-45744-2
eBook Packages: Springer Book Archive