Abstract
The results of the IJCAR ATP System Competition are presented.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Avenhaus, J., Hillenbrand, T. and Löchner, B.: On using ground joinable equations in equational theorem proving, in P. Baumgartner and H. Zhang (eds.), Proceedings of the 3rd International Workshop on First Order Theorem Proving, 2000, pp. 33–43.
Bachmair, L., Dershowitz, N. and Plaisted, D.: Completion without failure, in H. Ait-Kaci and M. Nivat (eds.), Resolution of Equations in Algebraic Structures, Academic Press, 1989, pp. 1–30.
Baumgartner, P.: FDPLL — A first order Davis—Putnam—Logeman—Loveland procedure, in: D. McAllester (ed.), Proceedings of the 17th International Conference on Automated Deduction, Springer-Verlag, 2000, pp. 200–219.
Hillenbrand, T., Jaeger, A. and Löchner, B.: Waldmeister — Improvements in performance and ease of use, in H. Ganzinger (ed.), Proceedings of the 16th International Conference on Automated Deduction, Springer-Verlag, 1999, pp. 232–236.
Letz, R. and Stenz, G.: System description: DCTP — A Disconnection Calculus Theorem Prover, in R. Gore, A. Leitsch and T. Nipkow (eds.), Proceedings of the International Joint Conference on Automated Reasoning. Springer-Verlag, 2001, pp. 381–385.
Moser, M., Ibens, O., Letz, R., Steinbach, J., Goller, C., Schumann, J. and Mayr, K.: SETHEO and E-SETHEO: The CADE-13 systems, J. Automated Reasoning 18(2) (1997), 237–246.
Riazanov, A. and Voronkov, A.: Partiallly adaptive code trees, in M. Ojeda-Aciego, I. de Guzman, G. Brewka and L. Pereira (eds.), Proceedings of the 7th European Workshop on Logics in Artificial Inteligence, Springer-Verlag, 2000, pp. 209–223.
Schulz, S.: System abstract: E 0.61, in R. Gore, A. Leitsch and T. Nipkow (eds.), Proceedings of the International Joint Conference on Automated Reasoning, Springer-Verlag, 2001, pp. 370–375.
Slaney, J.: FINDER: Finite Domain Enumerator, system description, in A. Bundy (ed.), Proceedings of the 12th International Conference on Automated Deduction, Springer-Verlag, 1994, pp. 798–801.
Stickel, M.: A Prolog technology theorem prover: A new exposition and implementation in Prolog, Technical Note 464, SRI International, Menlo Park, California, USA, 1989.
Sutcliffe, G.: The CADE-16 ATP system competition, J. Automated Reasoning 24(3) (2000), 371–396.
Sutcliffe, G.: Proceedings of the IJCAR ATP System Competition, Siena, Italy, 2001a.
Sutcliffe, G.: The CADE-17 ATP system competition, J. Automated Reasoning 27(3) (2001b), 227–250.
Sutcliffe, G. and Suttner, C.: Special issue: The CADE-13 ATP system competition, J. Automated Reasoning 18(2) (1997).
Sutcliffe, G. and Suttner, C.: The TPTP problem library: CNF release v1.2.1, J. Automated Reasoning 21(2) (1998), 177–203.
Sutcliffe, G. and Suttner, C.: The CADE-15 ATP system competition, J. Automated Reasoning 23(1) (1999), 1–23.
Sutcliffe, G., Suttner, C. and Pelletier, J.: The IJCAR ATP system competition: All the details, Technical Report UM-CSC-2001-001, Department of Computer Science, University of Miami, Miami, Florida, USA, 2001.
Suttner, C. and Sutcliffe, G.: The CADE-14 ATP system competition, J. Automated Reasoning 21(1) (1998), 99–134.
Weidenbach, C., Gaede, B. and Rock, G.: SPASS and FLOTTER, in M. McRobbie and J. Slaney (eds.), Proceedings of the 13th International Conference on Automated Deduction, Springer-Verlag, 1996, pp. 141–145.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Sutcliffe, G., Suttner, C.B. & Pelletier, F.J. The IJCAR ATP System Competition. Journal of Automated Reasoning 28, 307–320 (2002). https://doi.org/10.1023/A:1015736313131
Issue Date:
DOI: https://doi.org/10.1023/A:1015736313131