会议论文详细信息
CICM Workshop on Empirically Successful Automated Reasoning in Mathematics | |
Automated Theorem Proving in Loop Theory | |
计算机科学;数学 | |
J. D. Phillips ; David Stanovsky | |
Others : http://CEUR-WS.org/Vol-378/paper3.pdf PID : 46706 |
|
学科分类:计算机科学(综合) | |
来源: CEUR | |
【 摘 要 】
In this paper we compare the performance of various automated theorem provers on nearly all of the theorems in loop theory known to have been obtained with the assistance of automated theorem provers. Our analysis yields some surprising results, e.g., the theorem prover most often used by loop theorists doesn’t necessarily yield the best performance.
【 预 览 】
Files | Size | Format | View |
---|---|---|---|
Automated Theorem Proving in Loop Theory | 145KB | download |