CADE ATP System Competition: Difference between revisions

Revision as of 17:12, 14 July 2018

Revision as of 20:58, 20 July 2018

Line 1:

<!-- Please do not remove or change this AfD message until the discussion has been closed. -->

{{Article for deletion/dated|page=CADE ATP System Competition|timestamp=20180713135737|year=2018|month=July|day=13|substed=yes|help=off}}

<!-- Once discussion is closed, please place on talk page: {{Old AfD multi|page=CADE ATP System Competition|date=13 July 2018|result='''keep'''}} -->

<!-- End of AfD message, feel free to edit beyond this point -->

The '''CADE ATP System Competition''' (CASC) is a yearly competition of fully [[Automated theorem proving|automated theorem provers]] for [[classical logic]]<ref>{{cite journal|last=Sutcliffe|first=Geoff|title=The 5th IJCAR Automated Theorem Proving System Competition - CASC-J5|journal=AI Communications|year=2011|volume=24|issue=1|pages=75–89}}</ref><ref>{{cite web|url=http://www.cs.miami.edu/~tptp/CASC/|title=The CADE ATP System Competition|author=[[Geoff Sutcliffe]]|accessdate=2008-10-23}}</ref><ref name=stateofcasc>{{cite journal|journal=AI Communications|title=The State of CASC|year=2006|volume=19|issue=1|pages=35–48|author=Geoff Sutcliffe and Christian Suttner}}</ref><ref>{{cite journal|journal=AI Communications|title=The Development of CASC|year=2002|volume=15|issue=2–3|pages=79–90|author=Jeff Pelletier, Geoff Sutcliffe and Christian Suttner}}</ref> CASC is associated with the [[Conference on Automated Deduction]] and the [[International Joint Conference on Automated Reasoning]] organized by the [[Association for Automated Reasoning]]. It has inspired similar competition in related fields, in particular the successful SMT-COMP competition<ref>{{cite journal |last1=Barrett |first1=Clark |last2=de Moura |first2=Leonardo |last3=Stump |first3=Aaron |title=SMT-COMP: Satisfiability Modulo Theories Competition |journal=Computer Aided Verification. CAV 2005 |date=2005 |volume=3576 |publisher=Springer}}</ref> for [[Satisfiability Modulo Theories]], the SAT Competition<ref>{{cite journal |last1=Matti |first1=Järvisalo |last2=Le Berre |first2=Daniel |last3=Roussel |first3=Olivier |last4=Simon |first4=Laurent |title=The international SAT solver competitions} |journal=AI Magazine |date=2012 |volume=33 |issue=1 |pages=89-92 |url=http://www.aaai.org/ojs/index.php/aimagazine/article/download/2395/2278}}</ref> for propositional reasoners, and the modal logic reasoning competition.<ref>{{cite journal |last1=Massacci |first1=Fabio |last2=Donini |first2=Francesco M. |title=Design and results of TANCS-2000 non-classical (modal) systems comparison |journal=International Conference on Automated Reasoning with Analytic Tableaux and Related Methods |date=2000 |volume=1847 |pages=52-56 |publisher=Springer}}</ref>