The CADE-21 automated theorem proving system competition

Authors:
Geoff Sutcliffe
Affiliations:
Department of Computer Science, University of Miami, Miami, FL, USA. E-mail: geoff@cs.miami.edu
Venue:
AI Communications
Year:
2008

Citing 15
Cited 7

Evaluating general purpose automated theorem proving systems

Artificial Intelligence
Towards a standard upper ontology

Proceedings of the international conference on Formal Ontology in Information Systems - Volume 2001
The TPTP Problem Library

Journal of Automated Reasoning
The CADE-16 ATP System Competition

Journal of Automated Reasoning
Smart Selective Competition Parallelism ATP

Proceedings of the Twelfth International Florida Artificial Intelligence Research Society Conference
SPASS & FLOTTER Version 0.42

CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
New Directions in Instantiation-Based Theorem Proving

LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
leanCoP: lean connection-based theorem proving

Journal of Symbolic Computation - Special issue: First order theorem proving
The state of CASC

AI Communications
MPTP 0.2: Design, Implementation, and Initial Experiments

Journal of Automated Reasoning
The 3rd IJCAR Automated Theorem Proving Competition

AI Communications
Encodings of Bounded LTL Model Checking in Effectively Propositional Logic

CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
On evaluating decision procedures for modal logic

IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
ATP cross-verification of the Mizar MPTP challenge problems

LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Clausal connection-based theorem proving in intuitionistic first-order logic

TABLEAUX'05 Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods

leanCoP 2.0 and ileanCoP 1.2: High Performance Lean Theorem Proving in Classical and Intuitionistic Logic (System Descriptions)

IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
The 4th IJCAR Automated Theorem Proving System Competition - CASC-J4

AI Communications
Automated verification of refinement laws

Annals of Mathematics and Artificial Intelligence
The TPTP Problem Library and Associated Infrastructure

Journal of Automated Reasoning
The CADE-22 automated theorem proving system competition - CASC-22

AI Communications
Combining instance generation and resolution

FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
Automatic proof and disproof in Isabelle/HOL

FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The CADE ATP system competition (CASC) is an annual evaluation of fully automatic, first order Automated Theorem Proving (ATP) systems. CASC-21 was the twelfth competition in the CASC series. Twenty 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.