An overview of methods for large-theory automated theorem proving

CEUR Workshop Proceedings

Volumn 760, Issue , 2011, Pages 3-8

  Urban, Josef ^a  

^a RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

THEOREM PROVING;

AUTOMATED REASONING; AUTOMATED THEOREM PROVING; FIRST ORDER; STATE OF THE ART;

AUTOMATION;

EID: 84863609884     PISSN: 16130073     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (30)

1. P. A. Cairns. Informalising formal mathematics: Searching the Mizar library with latent semantics. In A. Asperti, G. Bancerek, and A. Trybulec, editors, MKM, volume 3119 of Lecture Notes in Computer Science, pages 58-72. Springer, 2004.
2. K. Claessen and N. Sorensson. New Techniques that Improve MACE-style Finite Model Finding. In P. Baumgartner and C. Fermueller, editors, Proceedings of the CADE-19 Workshop: Model Compu- tation - Principles, Algorithms, Applications, 2003.
3. U. Furbach, I. Glöckner, and B. Pelzer. An application of automated reasoning in natural language question answering. AI Commun., 23(2-3):241-265, 2010.
4. T. C. Hales. Introduction to the yspeck project. In Thierry Coquand, Henri Lombardi, and Marie-Françoise Roy, editors, Mathematics, Algorithms, Proofs, volume 05021 of Dagstuhl Seminar Proceedings. Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany, 2005.
5. T. C. Hales, J. Harrison, S. McLaughlin, T. Nipkow, S. Obua, and R. Zumkeller. A revision of the proof of the kepler conjecture. Discrete & Computational Geometry, 44(1):1-34, 2010.
6. K. Hoder and A. Voronkov. Sine qua non for large theory reasoning. In CADE 11, 2011. To appear.
7. D. Lenat. An Artificial Intelligence Approach to Discovery in Mathematics. PhD thesis, Stanford University, Stanford, USA, 1976.
8. W.W. McCune. Prover9. http://www.mcs.anl.gov/mccune/prover9/.
9. W.W. McCune. Mace4 Reference Manual and Guide. Technical Report ANL/MCS-TM-264, Argonne National Laboratory, Argonne, USA, 2003.
10. J. Meng and L. C. Paulson. Translating higher-order clauses to first-order clauses. J. Automated Reasoning, 40(1):35-60, 2008.
11. J. Meng and L. C. Paulson. Lightweight relevance filtering for machine-generated resolution problems. J. Applied Logic, 7(1):41-57, 2009.
12. J. Otten and W. Bibel. leanCoP: Lean Connection-Based Theorem Proving. Journal of Symbolic Computation, 36(1-2):139-161, 2003.
13. A. Pease and G. Sutcliffe. First order reasoning on a large ontology. In G. Sutcliffe et al. [23].
14. P. Pudlak. Search for Faster and Shorter Proofs using Machine Generated lemmas. In G. Sutcliffe, R. Schmidt, and S. Schulz, editors, Proceedings of the FLoC'06 Workshop on Empirically Successful Computerized Reasoning, 3rd International Joint Conference on Automated Reasoning, volume 192 of CEUR Workshop Proceedings, pages 34-52, 2006.
15. P. Pudlak. Semantic selection of premisses for automated theorem proving. In G. Sutcliffe et al. [23].
16. D. Ramachandran, Reagan P., and K. Goolsbey. First-orderized ResearchCyc: Expressiveness and Eficiency in a Common Sense Knowledge Base. In P. Shvaik , editor, Proceedings of the Workshop on Contexts and Ontologies: Theory, Practice and Applications, 2005.
17. S. Schulz. Learning Search Control Knowledge for Equational Deduction. PhD thesis, Technische Universität München, Munich, Germany, 2000.
18. S. Schulz. E: A Brainiac Theorem Prover. AI Communications, 15(2-3):111-126, 2002.
19. J. Shrager, R. Waldinger, M. Stickel, and J. P. Massar. Deductive biocomputing. PLoS ONE, 2(4):e339, Apr 2007.
20. J. K. Slaney, E. Lusk, and W. W. McCune. SCOTT: Semantically Constrained Otter, System Description. In A. Bundy, editor, Proceedings of the 12th International Conference on Automated Deduction, number 814 in Lecture Notes in Artificial Intelligence, pages 764-768. Springer-Verlag, 1994.
21. F. M. Suchanek, G. Kasneci, and G.Weikum. YAGO: A large ontology from Wikipedia andWordNet. J. Web Semantics, 6(3):203-217, 2008.
22. G. Sutcliffe and Y. Puzis. SRASS - A semantic relevance axiom selection system. In F. Pfenning, editor, CADE, volume 4603 of Lecture Notes in Computer Science, pages 295-310. Springer, 2007.
23. G. Sutcliffe, J. Urban, and S. Schulz, editors. Proceedings of the CADE-21 Workshop on Empirically Successful Automated Reasoning in Large Theories, volume 257 of CEUR Workshop Proceedings. CEUR-WS.org, 2007.
24. J. Urban. MoMM - fast interreduction and retrieval in large libraries of formalized mathematics. International Journal on Artificial Intelligence Tools, 15(1):109-130, 2006.
25. J. Urban. Mptp 0.2: Design, implementation, and initial experiments. J. Automated Reasoning, 37(1-2):21-43, 2006.
26. J. Urban, K. Hoder, and A. Voronkov. Evaluation of automated theorem proving on the Mizar mathematical library. In K. Fukuda, J. van der Hoeven, M. Joswig, and N. Takayama, editors, ICMS, volume 6327 of Lecture Notes in Computer Science, pages 155-166. Springer, 2010.
27. J. Urban, G. Sutcliffe, P. Pudlák, and J. Vyskocil. MaLARea SG1-machine learner for automated reasoning with semantic guidance. In A. Armando, P. Baumgartner, and G. Dowek, editors, IJCAR, volume 5195 of Lecture Notes in Computer Science, pages 441-456. Springer, 2008.
28. J. Urban, Jirí Vyskocil, and Petr Stepánek. MaLeCoP: Machine learning connection prover. In K. Brünnler and G. Metcalfe, editors, TABLEAUX, volume 6793 of Lecture Notes in Computer Science, pages 263-277. Springer, 2011.
29. J. Vyskocil, D. Stanovský, and J. Urban. Automated proof compression by invention of new definitions. In E. M. Clarke and A. Voronkov, editors, LPAR (Dakar), volume 6355 of Lecture Notes in Computer Science, pages 447-462. Springer, 2010.
30. C. Weidenbach, D. Dimova, A. Fietzke, R. Kumar, M. Suda, and P. Wischnewski. Spass version 3.5. In R. A. Schmidt, editor, CADE, volume 5663 of Lecture Notes in Computer Science, pages 140-145. Springer, 2009.