Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
article

The CADE-23 Automated Theorem Proving System Competition - CASC-23

Published: 01 January 2012 Publication History

Abstract

The CADE ATP System Competition (CASC) is an annual evaluation of fully automatic, classical logic Automated Theorem Proving (ATP) systems. CASC-23 was the sixteenth competition in the CASC series. Thirty-six ATP systems and system variants competed in the various competition and demonstration divisions. An outline of the competition design, and a commentated summary of the results, are presented.

References

[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. Bj¿rner, 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.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image AI Communications
AI Communications  Volume 25, Issue 1
January 2012
68 pages

Publisher

IOS Press

Netherlands

Publication History

Published: 01 January 2012

Author Tags

  1. Automated theorem proving
  2. competition

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 16 Oct 2024

Other Metrics

Citations

Cited By

View all
  • (2015)MaLeSJournal of Automated Reasoning10.1007/s10817-015-9329-155:2(91-116)Online publication date: 1-Aug-2015
  • (2013)First-Order Theorem Proving and VampireProceedings of the 25th International Conference on Computer Aided Verification - Volume 804410.5555/2958031.2958033(1-35)Online publication date: 13-Jul-2013
  • (2013)The 6th IJCAR automated theorem proving system competition --CASC-J6AI Communications10.5555/2594582.259458626:2(211-223)Online publication date: 1-Apr-2013
  • (2012)Implementing and evaluating provers for first-order modal logicsProceedings of the 20th European Conference on Artificial Intelligence10.5555/3007337.3007370(163-168)Online publication date: 27-Aug-2012
  • (2012)SatallaxProceedings of the 6th international joint conference on Automated Reasoning10.1007/978-3-642-31365-3_11(111-117)Online publication date: 26-Jun-2012
  • (2012)The TPTP typed first-order form with arithmeticProceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning10.1007/978-3-642-28717-6_32(406-419)Online publication date: 11-Mar-2012

View Options

View options

Get Access

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media