CADE-15 ATP system competition

Journal of Automated Reasoning

Volumn 23, Issue 1, 1999, Pages 1-23

  Sutcliffe, G ^a   Suttner, C B ^b  

^a JAMES COOK UNIVERSITY   (Australia)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

INTERNET; PROBLEM SOLVING; TECHNICAL PRESENTATIONS;

AUTOMATED THEOREM PROVING (ATP) SYSTEMS;

THEOREM PROVING;

EID: 0032653951     PISSN: 01687433     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1006285423991     Document Type: Article

References (23)

1. Bachmair, L., Dershowitz, N. and Plaisted, D. A.: Completion without failure, in H. Ait-Kaci and M. Nivat (eds.), Resolution of Equations in Algebraic Structures, Academic Press, 1989, pp. 1-30.
2. Buch, A. and Hillenbrand, T.: Waldmeister: Development of a high performance completion-based theorem prover, Technical Report SEKI-Report SR-96-01, AG Effiziente Algorithmen, Universität Kaiserslautern, Kaiserslautern, Germany, 1996.
3. Fermüller, C., Leitsch, A., Tammet, T. and Zamov, N.: Resolution Methods for the Decision Problem, Lecture Notes in Comput. Sci. 679, Springer-Verlag, 1993.
4. Ganzinger, H., Meyer, C. and Weidenbach, C.: Soft typing for ordered resolution, in W. W. McCune (ed.), Proceedings of the 14th International Conference on Automated Deduction, Lecture Notes in Artif. Intell. 1249, Springer-Verlag, 1997, pp. 321-335.
5. Greiner, M. and Schramm, M.: A probablistic stopping criterion for the evaluation of benchmarks, Technical Report 19638, Institut für Informatik, Technische Universität München, München, Germany, 1996.
6. Hillenbrand, T., Buch, A., Vogt, R. and Löchner, B.: Waldmeister: High performance equational deduction, J. Automated Reasoning 18(2) (1997), 265-270.
7. Kaufmann, M.: ACL2 Support for Verification Projects, in C. Kirchner and H. Kirchner (eds.), Proceedings of the 15th International Conference on Automated Deduction, Lecture Notes in Artif. Intell. 142, Springer-Verlag, 1998, pp. 220-238.
8. Nonnengart, A., Rock, G. and Weidenbach, C.: On generating small clause normal forms, in C. Kirchner and H. Kirchner (eds.), Proceedings of the 15th International Conference on Automated Deduction, Lecture Notes in Artif. Intell. 1421, Springer-Verlag, 1998, pp. 397-411.
9. Slaney, J. K., Lusk, E. and McCune, W. W.: SCOTT: Semantically constrained Otter, system description, in A. Bundy (ed.), Proceedings of the 12th International Conference on Automated Deduction, Lecture Notes in Artif. Intell. 814, Springer-Verlag, 1994, pp. 764-768.
10. Suttner, C. B. and Schumann, J.: Parallel automated theorem proving, in L. Kanal, V Kumar, H. Kitano, and C. Suttner (eds.), Parallel Processing for Artificial Intelligence 1, Elsevier Science, 1994, pp. 209-257.
11. Sutcliffe, G. and Suttner, C. B.: Special issue: The CADE-13 ATP system competition, J. Automated Reasoning 18(2) (1997).
12. Sutcliffe, G. and Suttner, C. B.: The procedures of the CADE-13 ATP system competition, J. Automated Reasoning 18(2) (1997), 163-169.
13. Suttner, C. B. and Sutcliffe, G.: The design of the CADE-13 ATP system competition, J. Automated Reasoning 18(2) (1997), 139-162.
14. Sutcliffe, G. and Suttner, C.: The CADE-14 ATP system competition, Technical Report 98/01, Department of Computer Science, James Cook University, Townsville, Australia, 1998.
15. Sutcliffe, G. and Suttner, C. B.: Proceedings of the CADE-15 ATP System Competition, Lindau, Germany, 1998.
16. Sutcliffe, G. and Suttner, C. B.: The TPTP problem library: CNF release v1.2.1, J. Automated Reasoning 21(2) (1998), 177-203.
17. Suttner, C. B. and Sutcliffe, G.: The CADE-14 ATP system competition, J. Automated Reasoning 21(1) (1998), 99-134.
18. Tammet, T.: A resolution theorem prover for intuitionistic logic, in M. McRobbie and J. K. Slaney (eds.), Proceedings of the 13th International Conference on Automated Deduction, Lecture Notes in Artif. Intell. 1104, Springer-Verlag, 1996, pp. 2-16.
19. Tammet, T.: Gandalf, J. Automated Reasoning 18(2) (1997), 199-204.
20. Tammet, T.: Towards efficient subsumption, in C. Kirchner and H. Kirchner (eds.), Proceedings of the 15th International Conference on Automated Deduction, Lecture Notes in Artif. Intell. 1421, Springer-Verlag, 1998, pp. 427-440.
21. Tammet, T. and Smith, J.: Optimised encodings of fragments of type theory in first order logic, in S. Berardi and M. Coppo (eds.), Types for Proofs and Programs: Proceedings of the International Workshop TYPES'95, Lecture Notes in Artif. Intell. 1158, Springer-Verlag, 1996, pp. 265-287.
22. Weidenbach, C.: Email to G. Sutcliffe, 1997.
23. Weidenbach, C.: SPASS: Version 0.49, J. Automated Reasoning 18(2) (1997), 247-252.