Search for faster and shorter proofs using machine generated lemmas

CEUR Workshop Proceedings

Volumn 192, Issue , 2006, Pages 34-52

  Pudlák, Petr ^a  

^a CHARLES UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATED THEOREM PROVER; COMMON LANGUAGES;

THEOREM PROVING;

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

References (16)

1. Owen L. Astrachan and Mark E. Stickel. Caching and lemmaizing in model elimination theorem provers. In Deepak Kapur, editor, CADE, volume 607 of Lecture Notes in Computer Science, pages 224-238. Springer, 1992.
2. Simon Colton. Automated Theory Formation in Pure Mathematics. Distinguished Dissertations. Springer, 2002.
3. Simon Colton. The HR program for theorem generation. In Andrei Voronkov, editor, CADE, volume 2392 of Lecture Notes in Computer Science, pages 285-289. Springer, 2002.
4. P. T. Cox and T. Pietrzykowski. A complete, nonredundant algorithm for reversed skolemization, volume 87 of Lecture Notes in Computer Science. Springer, May 1980.
5. Ritu Chadha and David Plaisted. Finding logical consequences using unskolemiza-tion, volume 689 of Lecture Notes in Computer Science. Springer, May 1993.
6. Marc Fuchs, Dirk Fuchs, and Matthias Fuchs. Generating lemmas for tableau-based proof search using genetic programming. In Wolfgang Banzhaf, Jason Daida, Agoston E. Eiben, Max H. Garzon, Vasant Honavar, Mark Jakiela, and Robert E. Smith, editors, Proceedings ofthe Genetic and Evolutionary Computation Conference, volume 2, pages 1027-1032, Orlando, Florida, USA, July 1999. Morgan Kaufmann
7. John Halleck. Logic systems, 2005. http://www.cc.utah.edu/~nahaj/logic/ structures/.
8. W. W. McCune. OTTER 3.0 reference manual and guide. Technical Report ANL-94/6, Argonne National Laboratory, Argonne, Illinois, 1994.
9. William McCune, Robert Veroff, Branden Fitelson, Kenneth Harris, Andrew Feist, and Larry Wos. Short single axioms for boolean algebra. J. Autom. Reasoning, 29(1):1-16,2002.
10. Art Quaife. Automated Development of Fundamental Mathematical Theories. Kluwer Academic Publishers, 1992.
11. S. Schulz. E-A brainiac theorem prover. Journal ofAI Communications, 15(2-3):111-126, 2002.
12. G. Sutcliffe, Y. Gao, and S. Colton. A Grand Challenge of Theorem Discovery. In J. Gow, T. Walsh, S. Colton, and V. Sorge, editors, Proceedings of the Workshop on Challenges and Novel Applications for Automated Reasoning, 19th International Conference on Automated Reasoning, pages 1-11, 2003.
13. G. Sutcliffe and C. B. Suttner. The TPTP Problem Library: CNF Release v1.2.1. Journal of Automated Reasoning, 21(2):177-203, 1998.
14. Josef Urban. Translating Mizar for first order theorem provers. In MKM, volume 2594 of Lecture Notes in Computer Science, pages 203-215. Springer, 2003.
15. Josef Urban. MPTP-motivation, implementation, first experiments. Journal of Automated Reasoning, 33(3-4):319-339, 2004.
16. Larry Wos and Gail W. Pieper. Automated Reasoning and the Discovery ofMissing and Elegant Proofs. Rinton Press, 2003.