Automated and human proofs in general mathematics: An initial comparison

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7180 LNCS, Issue , 2012, Pages 37-45

  Alama, Jesse ^a   Kühlwein, Daniel ^b   Urban, Josef ^b  

^a UNIVERSIDADE NOVA DE LISBOA   (Portugal)

^b RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATED REASONING; AUTOMATED SYSTEMS; FIRST-ORDER; IRRELEVANT KNOWLEDGE; MATHEMATICAL KNOWLEDGE; MIZAR MATHEMATICAL LIBRARIES;

ARTIFICIAL INTELLIGENCE; AUTOMATA THEORY; AUTOMATION;

MATHEMATICAL PROGRAMMING;

EID: 84858328940     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-28717-6_6     Document Type: Conference Paper

References (18)

1. Alama, J., Kühlwein, D., Tsivtsivadze, E., Urban, J., Heskes, T.: Premise selection for mathematics by corpus analysis and kernel methods. CoRR, abs/1108.3446
2. Alama, J., Mamane, L., Urban, J.: Dependencies in formal mathematics. CoRR, abs/1109.3687 (2011), http://arxiv.org/abs/1109.3687
3. Dahn, I.: Robbins algebras are Boolean: A revision of McCune's computer-generated solution of Robbins problem. Journal of Algebra 208, 526-532 (1998)
4. Dosen, K.: Identity of proofs based on normalization and generality. Bulletin of Symbolic Logic 9, 477-503 (2003)
5. Fitelson, B.: Using Mathematica to understand the computer proof of the Robbins Conjecture. Mathematica In Education and Research 7(1) (1998)
6. Hales, T.: Mathematics in the age of the Turing Machine. Lecture Notes in Logic in Commemoration of the Centennial of the Birth of Alan Turing (to appear, 2012)
7. Hoder, K., Voronkov, A.: Sine Qua Non for Large Theory Reasoning. In: Bjørner, N., Sofronie-Stokkermans, V. (eds.) CADE 2011. LNCS, vol. 6803, pp. 299-314. Springer, Heidelberg (2011)
8. McCune, W.W.: Solution of the Robbins Problem. Journal of Automated Reasoning 19(3), 263-276 (1997)
9. Meng, J., Paulson, L.C.: Lightweight relevance filtering for machine-generated resolution problems. J. Applied Logic 7(1), 41-57 (2009)
10. Paulson, L.C., Blanchette, J.: Three years of experience with Sledgehammer, a practical link between automated and interactive theorem provers. In: 8th IWIL (2010)
11. Phillips, J.D., Stanovský, D.: Automated Theorem Proving in Loop Theory. In: Sutcliffe, G., Colton, S., Schulz, S. (eds.) ESARM. CEUR Workshop Proceedings, vol. 378, pp. 42-53. CEUR-WS.org (2008)
12. Pudlák, P.: Semantic selection of premisses for automated theorem proving. In: Sutcliffe, G., Urban, J., Schulz, S. (eds.) ESARLT. CEUR Workshop Proceedings, vol. 257. CEURWS. org (2007)
13. Schulz, S.: E - a brainiac theorem prover. J. of AI Communications 15(2-3), 111-126 (2002)
14. Urban, J.: MPTP 0.2: Design, implementation, and initial experiments. J. Autom. Reasoning 37(1-2), 21-43 (2006)
15. Urban, J., Hoder, K., Voronkov, A.: Evaluation of Automated Theorem Proving on the Mizar Mathematical Library. In: Fukuda, K., van der Hoeven, J., Joswig, M., Takayama, N. (eds.) ICMS 2010. LNCS, vol. 6327, pp. 155-166. Springer, Heidelberg (2010)
16. Urban, J., Sutcliffe, G., Pudlák, P., Vyskočil, J.: MaLARea SG1-Machine learner for automated reasoning with semantic guidance. In: IJCAR, pp. 441-456 (2008)
17. Urban, J., Vyskočil, J., Štěpánek, P.: MaLeCoP Machine Learning Connection Prover. In: Brünnler, K., Metcalfe, G. (eds.) TABLEAUX 2011. LNCS, vol. 6793, pp. 263-277. Springer, Heidelberg (2011)
18. Vyskočil, J., Stanovský, D., Urban, J.: Automated Proof Compression by Invention of New Definitions. In: Clarke, E.M., Voronkov, A. (eds.) LPAR-16 2010. LNCS, vol. 6355, pp. 447-462. Springer, Heidelberg (2010)