The CADE-23 automated theorem proving system competition - CASC-23

AI Communications

Volumn 25, Issue 1, 2012, Pages 49-63

  Sutcliffe, Geoff ^a  

^a University of Miami   (United States)

Author keywords

Automated theorem proving; competition

Indexed keywords

AUTOMATED THEOREM PROVING; CADE ATP SYSTEM COMPETITIONS; CLASSICAL LOGIC; COMPETITION DESIGN; SYSTEM VARIANTS;

AUTOMATION; COMPETITION; THEOREM PROVING;

PROBLEM SOLVING;

EID: 84858167689     PISSN: 09217126     EISSN: None     Source Type: Journal    
DOI: 10.3233/AIC-2012-0512     Document Type: Article

References (26)

1. J. Blanchette and T. Nipkow, Nitpick: A counterexample generator for higher-order logic based on a relational model finder, in: Proceedings of the 1st International Conference on Interactive Theorem Proving, L. Paulson and M. Kaufmann, eds, Lecture Notes in Computer Science, Vol. 6172, Springer-Verlag, Berlin, 2010, pp. 131-146.
2. K. Claessen and N. Sörensson, 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.
3. B. Dutertre and L. de Moura, The YICES SMT solver, 2006, available at: Http://yices.csl.sri.com/tool-paper.pdf.
4. N. Eén and N. Sörensson, MiniSat -A SAT solver with conflict-clause minimization, in: Posters of the 8th International Conference on Theory and Applications of Satisfiability Testing, F. Bacchus and T. Walsh, eds, 2005.
5. M. Gebser, O. Sabuncu and T. Schaub, An incremental answer set programming based system for finite model computation, AI Communications 24(2) (2011), 195-212.
6. K. Hoder and A. Voronkov, Sine Qua Non for large theory reasoning, in: Proceedings of the 23rd International Conference on Automated Deduction, V. Sofronie-Stokkermans and N. Bjoerner, eds, Lecture Notes in Artificial Intelligence, Vol. 6803, Springer-Verlag, Berlin, 2011, pp. 299-314.
7. B. Loechner, Things to know when implementing KBO, Journal of Automated Reasoning 36(4) (2006), 289-310.
8. W.W. McCune, Prover9, available at: Http://www.cs.unm. edu/~mccune/prover9/.
9. J. Meng and L. Paulson, Translating higher-order problems to first-order clauses, Journal of Automated Reasoning 40(1) (2008), 35-60.
10. V. Prevosto and U. Waldmann, SPASS+T, in: Proceedings of the FLoC'06 Workshop on Empirically Successful Computerized Reasoning, 3rd International Joint Conference on Automated Reasoning, G. Sutcliffe, R. Schmidt, and S. Schulz, eds, CEUR Workshop Proceedings, Vol. 192, 2006, pp. 19-33.
11. A. Riazanov and A. Voronkov, Splitting without backtracking, in: Proceedings of the 17th International Joint Conference on Artificial Intelligence, B. Nebel, ed., Morgan Kaufmann, San Francisco, CA, USA, 2001, pp. 611-617.
12. M. Schneidner and G. Sutcliffe, Reasoning in the OWL 2 full ontology language using first-order automated theorem proving, in: Proceedings of the 23rd International Conference on Automated Deduction, N. Bjorner and V. Sofronie-Stokkermans, eds, Lecture Notes in Artificial Intelligence, Vol. 6803, Springer-Verlag, Berlin, 2011, pp. 461-475.
13. S. Schulz, Fingerprint indexing for paramodulation, in: Deduktionstreffen 2010, B. Beckert and T. Bormer, eds, 2010.
14. G. Sutcliffe, The CADE-16 ATP system competition, Journal of Automated Reasoning 24(3) (2000), 371-396.
15. G. Sutcliffe, The 4th IJCAR Automated Theorem Proving System Competition -CASC-J4, AI Communications 22(1) (2009), 59-72.
16. G. Sutcliffe, The TPTP problem library and associated infrastructure. The FOF and CNF Parts, v3.5.0, Journal of Automated Reasoning 43(4) (2009), 337-362.
17. G. Sutcliffe, Proceedings of the CADE-23 ATP System Competition, Wroclaw, Poland, 2011.
18. G. Sutcliffe, The 5th IJCAR Automated Theorem Proving System Competition -CASC-J5, AI Communications 24(1) (2011), 75-89.
19. G. Sutcliffe, S. Schulz, K. Claessen and P. Baumgartner, The TPTP typed first-order form with arithmetic, in: Proceedings of the 18th International Conference on Logic for Programming Artificial Intelligence and Reasoning, N. Bjorner and A. Voronkov, eds, Lecture Notes in Artificial Intelligence, Vol. 7180, Springer-Verlag, Berlin, 2012, pp. 406-419.
20. G. Sutcliffe and C. Suttner, The state of CASC, AI Communications 19(1) (2006), 35-48.
21. G. Sutcliffe and C.B. Suttner, Evaluating general purpose automated theorem proving systems, Artificial Intelligence 131(1,2) (2001), 39-54.
22. E. Torlak and D. Jackson, Kodkod: A relational model finder, in: Proceedings of the 13th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, O. Grumberg and M. Huth, eds, Lecture Notes in Computer Science, Vol. 4424, Springer-Verlag, Berlin, 2007, pp. 632-647.
23. J. Urban, MPTP 0.2: Design, implementation, and initial experiments, Journal of Automated Reasoning 37(1,2) (2006), 21-43.
24. T. Weber, Bounded model generation for Isabelle/HOL, Electronic Notes in Theoretical Computer Science 125(3) (2005), 103-116.
25. 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., Lecture Notes in Artificial Intelligence, Vol. 2392, Springer-Verlag, Berlin, 2002, pp. 275-279.
26. S. Zimmer, Intelligent combination of a first order theorem prover and SMT procedures, Master's thesis, Saarland University, Saarbruecken, Germany, 2007.