The IJCAR-2004 Automated Theorem Proving Competition

AI Communications

Volumn 18, Issue 1, 2005, Pages 33-40

  Sutcliffe, Geoff ^a  

^a Department of Computer Science and Center for Computational Science   (United States)

Author keywords

Automated theorem proving; Competition

Indexed keywords

MATHEMATICAL MODELS; PROBLEM SOLVING; RESEARCH; SOCIETIES AND INSTITUTIONS; STRATEGIC PLANNING; THEOREM PROVING;

AUTOMATED THEOREM PROVING; COMPETITION DESIGN; COMPETITION RESOURCES; SYSTEM VARIANTS;

COMPETITION;

EID: 21144457003     PISSN: 09217126     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (15)

1. P. Baumgartner, A. Fuchs and C. Tinelli, Darwin - a theorem prover for the model evolution calculus, in: Proceedings of the Workshop on Empirically Successful First Order Reasoning, 2nd International Joint Conference on Automated Reasoning, G. Sutcliffe, S. Schulz and T. Tammet, eds, Electronic Notes in Theoretical Computer Science, 2004.
2. P. Baumgartner and C. Tinelli, The model evolution calculus, in: Proceedings of the 19th International Conference on Automated Deduction, F. Baader, ed., Number 2741 in Lecture Notes in Artificial Intelligence, Springer-Verlag, 2003, pp. 350-364.
3. K. Claessen and N. Sorensson, New techniques that improve MACE-style finite model finding, in: Proceedings of the CADE-19 Workshop: Model Computation - Principles, Algorithms, Applications, P. Baumgartner and C. Fermueller, eds, 2003.
4. S. Colton, A. Meier, V. Sorge and R. McCasland, Automatic generation of classification theorems for finite algebras, in: Proceedings of the 2nd International Joint Conference on Automated Reasoning, M. Rusinowitch and D. Basin, eds, Number 3097 in Lecture Notes in Artificial Intelligence, Springer-Verlag, 2004, pp. 400-414.
5. T. Hillenbrand, Citius altius fortius: lessons learned from the theorem prover Waldmeister, in: Proceedings of the 4th International Workshop on First-Order Theorem Proving, I. Dahn and L. Vigneron, eds, Number 86.1 in Electronic Notes in Theoretical Computer Science, Elsevier Science, 2003.
6. B. Loechner, A redundancy criterion based on ground reducibility by ordered rewriting, in: Proceedings of the 2nd International Joint Conference on Automated Reasoning, M. Rusinowitch and D. Basin, eds, Number 3097 in Lecture Notes in Artificial Intelligence, Springer-Verlag, 2004, pp. 45-59.
7. A. Riazanov and A. Voronkov, The design and implementation of Vampire, AI Communications 15(2-3) (2002), 91-110.
8. G. Stenz, DCTP 1.2 - system abstract, in: Proceedings of TABLEAUX 2002: Automated Reasoning with Analytic Tableaux and Related Methods, C. Fermüller and U. Egly, eds, Number 2381 in Lecture Notes in Artificial Intelligence, Springer-Verlag, 2002, pp. 335-340.
9. G. Stenz, The Disconnection Calculus, Logos Verlag, 2002. Dissertation, Fakultät für Informatik, Technische Universität München.
10. G. Stenz and A. Wolf, E-SETHEO: an automated theorem prover, in: Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX-2000), R. Dyckhoff, ed., Number 1847 in Lecture Notes in Artificial Intelligence, Springer-Verlag, 2000, pp. 436-440.
11. G. Sutcliffe, The CADE-16 ATP system competition, Journal of Automated Reasoning 24(3) (2000), 371-396.
12. G. Sutcliffe, in: Proceedings of the 2nd IJCAR's CADE ATP System Competition, Cork, Ireland, 2004.
13. G. Sutcliffe arid C. Suttner, The CADE-19 ATP system competition, AI Communications 17(3) (2004).
14. G. Sutcliffe and C.B. Suttner, The TPTP problem library: CNF release v 1.2.1, Journal of Automated Reasoning 21(2) (1998), 177-203.
15. C. Weidenbach, U. Brahm, T. Hillenbrand, E. Keen, C. Theobald and D. Topic, SPASS Version 2.0, in: Proceedings of the 18th International Conference on Automated Deduction, A. Voronkov, ed., Number 2392 in Lecture Notes in Artificial Intelligence, Springer-Verlag, 2002, pp. 275-279.