Abstract
It has become a tradition at CADE to run a competition for first-order automated theorem provers based on the TPTP problem library. This competition (CASC) [SuSu96] aims at fully automatic ATP systems and provides various categories dedicated to diffirent problem classes of rst-order logic. The number of problems solved and the runtime is used to assess the winners in the individual categories of the competition.
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
B. Boyer and J S. Moore A Computational Logic. Academic Press, 1979
B.G. Buchanan: Artificial Intelligence as an Experimental Science. In J.H. Fetzer (ed.): Aspects of Artificial Intelligence, pp. 209–250, Kluwer Academic Publishers, 1988
A. Bundy, F. van Harmelen, J. Hesketh, and A. Smaill. Experiments with proof plans for induction. Journal of Automated Reasoning, 7:303–324, 1991
C. Prehofer and K. Slind: Theorem Proving in Interactive Verification Systems. Proceedings of the CADE-12 Workshop: Evaluation of Automated Theorem Proving Systems, 1994
C. Suttner and G. Suttcliff: The Design of the CADE-13 ATP System Competition. Proceedings of the 13th International Conference on Automated Deduction, CADE-13, Springer LNAI 1104, New Brunswick, USA, 1996
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hutter, D., Bundy, A. (1999). The Design of the CADE-16 Inductive Theorem Prover Contest. In: Automated Deduction — CADE-16. CADE 1999. Lecture Notes in Computer Science(), vol 1632. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48660-7_33
Download citation
DOI: https://doi.org/10.1007/3-540-48660-7_33
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66222-8
Online ISBN: 978-3-540-48660-2
eBook Packages: Springer Book Archive