首页> 外文会议>International conference on automated deduction >The CADE-25 ATP System Competition CASC-25
【24h】

The CADE-25 ATP System Competition CASC-25

机译:CADE-25 ATP系统竞赛CASC-25

获取原文

摘要

The CADE ATP System Competition (CASC) is an annual evaluation of fully automatic Automated Theorem Proving (ATP) systems for classical logic the world championship for such systems. One purpose of CASC is to provide a public evaluation of the relative capabilities of ATP systems. Additionally, CASC aims to stimulate ATP research, motivate development and implementation of robust ATP systems that are useful and easily deployed in applications, provide an inspiring environment for personal interaction between ATP researchers, and expose ATP systems within and beyond the ATP community. Fulfillment of these objectives provides insight and stimulus for the development of more powerful ATP systems, leading to increased and more effective use. CASC-25 was held on 4th August 2015 as part of the 25th International Conference on Automated Deduction (CADE-25), run on computers supplied by the StarExec project. CASC is run in divisions according to problem and system characteristics. For CASC-25 the divisions were: 1. THF: Typed Higher-order Form theorems (axioms with a provable conjecture). 2. THN: Typed Higher-order form Non-theorems (axioms with a countersatisfiable conjecture, and satisfiable axiom sets). This division was new for CASC-25. 3. TFA: Typed First-order with Arithmetic theorems (axioms with a provable conjecture). 4. TFN: Typed First-order with arithmetic Non-theorems (axioms with a countersatisfiable conjecture, and satisfiable axiom sets). This division was new for CASC-25. 5. FOF: First-Order Form theorems (axioms with a provable conjecture). 6. FNT: First-order form syntactically non-propositional Non-Theorems (axioms with a countersatisfiable conjecture, and satisfiable axiom sets). 7. EPR: Effectively PRopositional clause normal form (non-)theorems. 8. LTB: First-order form theorems (axioms with a provable conjecture) from Large Theories, presented in Batches with a shared time limit. Problems for CASC are taken from the TPTP Problem Library. The TPTP version used for CASC is released after the competition, so that new problems have not been seen by the entrants. The THF, TFA, FOF, FNT, and LTB divisions were ranked according to the number of problems solved with an acceptable proof/model output. The THN, TFN, and EPR divisions were ranked according to the number of problems solved, but not necessarily accompanied by a proof or model. Ties are broken according to the average time over problems solved. Division winners are announced and prizes are awarded.
机译:CADE ATP系统竞赛(CASC)是对经典逻辑的全自动自动定理证明(ATP)系统进行的年度评估,该系统是此类系统的世界冠军。 CASC的一个目的是对ATP系统的相对功能进行公开评估。此外,CASC旨在刺激ATP研究,激励强大的ATP系统的开发和实施,这些系统在应用程序中有用且易于部署,为ATP研究人员之间的个人互动提供了启发性的环境,并公开了ATP社区内外的ATP系统。这些目标的实现为开发功能更强大的ATP系统提供了见识和刺激因素,从而导致了更多,更有效的使用。 CASC-25于2015年8月4日举行,是第25届国际自动扣除会议(CADE-25)的一部分,该会议在StarExec项目提供的计算机上运行。 CASC根据问题和系统特征分部门运行。对于CASC-25,其划分为:1. THF:类型化高阶形式定理(具有可证明猜想的公理)。 2. THN:键入高阶形式的非定理(具有可满足的猜想和可满足的公理集的公理)。该部门是CASC-25的新部门。 3. TFA:带算术定理的第一阶(具有可证明猜想的轴)。 4. TFN:带算术非定理的类型一阶(具有可反猜想的公理和可满足的公理集)。该部门是CASC-25的新部门。 5. FOF:一阶形式定理(具有可证明猜想的公理)。 6. FNT:语法上的一阶形式非命题非定理(具有可满足的猜想和可满足的公理集的公理)。 7. EPR:有效地安排子句范式(非)定理。 8. LTB:大理论中的一阶形式定理(具有可证明猜想的公理),分批显示,共享时间限制。 CASC的问题来自TPTP问题库。比赛结束后发布了CASC所使用的TPTP版本,因此参赛者没有发现新的问题。 THF,TFA,FOF,FNT和LTB部门根据根据可接受的证据/模型输出解决的问题数量进行排名。根据解决的问题数量对THN,TFN和EPR部门进行排名,但不一定要附带证明或模型。根据解决问题的平均时间打破关系。宣布部门优胜者并颁奖。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号