CADE ATP System Competition

E1023683

The CADE ATP System Competition is an international contest that evaluates and compares the performance of automated theorem proving systems on standardized logical problem sets.

Try in SPARQL Jump to: Statements Referenced by

Statements (39)

Predicate Object
instanceOf automated theorem proving competition
international competition
scientific competition
acronym CASC NERFINISHED
compares performance of automated theorem provers
contributesTo benchmarking of theorem provers
standardization of ATP evaluation
evaluates automated theorem proving systems
field automated reasoning
automated theorem proving
mathematical logic
focusesOn classical logic
first-order logic
frequency annual
fullName CADE ATP System Competition NERFINISHED
hasCategory different logic divisions
different problem domains
hasGoal encourage development of more powerful theorem provers
evaluate efficiency of ATP systems
provide a fair basis for comparison of ATP systems
hasOutcome performance statistics
ranking of ATP systems
hasParticipant automated theorem prover
isHeldAt CADE conference NERFINISHED
IJCAR conference
language English
organizedBy Conference on Automated Deduction NERFINISHED
relatedTo CADE NERFINISHED
IJCAR NERFINISHED
TPTP Problem Library NERFINISHED
scope international
sponsoredBy CADE Inc. NERFINISHED
startedBefore 2000
uses TPTP problem library NERFINISHED
standardized logical problem sets
usesMetric CPU time
number of problems solved
resource usage
website http://www.tptp.org/CASC/

Referenced by (1)

Full triples — surface form annotated when it differs from this entity's canonical label.

Vampire automated theorem prover usedIn CADE ATP System Competition