Automated proof compression by invention of new definitions

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

Volumn 6355 LNAI, Issue , 2010, Pages 447-462

  Vyskočil, Jiří ^a   Stanovský, David ^b   Urban, Josef ^c  

^a CZECH TECHNICAL UNIVERSITY IN PRAGUE   (Czech Republic)

^b CHARLES UNIVERSITY   (Czech Republic)

^c RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ARBITRARY SETS; AUTOMATED PROOFS; AUTOMATED THEOREM PROVER; MATHEMATICAL PROBLEMS; MATHEMATICAL PROOF; STATE OF THE ART; SUBSTITUTION TREES;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; AUTOMATION; PATENTS AND INVENTIONS; COMPUTER CIRCUITS;

TREES (MATHEMATICS);

EID: 78650803682     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-17511-4_25     Document Type: Conference Paper

References (21)

1. Dahn, I.: Robbins algebras are boolean: A revision of mccune's computer-generated solution of robbins problem. Journal of Algebra 208(2), 526-532 (1998)
2. Gonthier, G.: The four colour theorem: Engineering of a formal proof. In: Kapur, D. (ed.) ASCM 2007. LNCS (LNAI), vol. 5081, p. 333. Springer, Heidelberg (2008)
3. Graf, P.: Term Indexing. LNCS, vol. 1053. Springer, Heidelberg (1996)
4. Grabowski, A.: Robbins algebras vs. boolean algebras. Formalized Mathematics 9(4), 681-690 (2001)
5. Huang, X.: Translating machine-generated resolution proofs into ndproofs at the assertion level. In: Foo, N.Y., Göbel, R. (eds.) PRICAI 1996. LNCS, vol. 1114, pp. 399-410. Springer, Heidelberg (1996)
6. McCune, W.: Solution of the Robbins problem. J. Autom. Reasoning 19(3), 263-276 (1997)
7. Meng, J., Paulson, L.C.: Translating higher-order clauses to first-order clauses. J. Autom. Reasoning 40(1), 35-60 (2008)
8. Nonnengart, A., Weidenbach, C.: Computing small clause normal forms. In: Robinson, J.A., Voronkov, A. (eds.) Handbook of Automated Reasoning, vol. I, pp. 335-367. Elsevier and MIT Press (2001)
9. Puzis, Y., Gao, Y., Sutcliffe, G.: Automated generation of interesting theorems. In: FLAIRS Conference, pp. 49-54 (2006)
10. Plotkin, G.D.: A note on inductive generalization. Machine Intelligence 5, 153-163 (1969)
11. Proietti, M., Pettorossi, A.: Unfolding-definition-folding, in this order, for avoiding unnecessary variables in logic programs. Theoretical Computer Science 142(1), 89-124 (1995)
12. Phillips, J.D., Stanovský, D.: Automated theorem proving in loop theory. In: Sutcliffe, G., Colton, S., Schulz, S. (eds.) ESARM: Empirically Successful Automated Reasoning in Mathematics. CEUR Workshop Proceedings, vol. 378, pp. 54-54. CEUR (2008)
13. Schulz, S.: E - a brainiac theorem prover. Journal of AI Communications 15(2-3), 111-126 (2002)
14. Stanovský, D.: Distributive groupoids are symmetric-by-medial: An elementary proof. Commentationes Mathematicae Universitatis Carolinae 49(4), 541-546 (2008)
15. Sutcliffe, G.: The tptp problem library and associated infrastructure. J. Autom. Reasoning 43(4), 337-362 (2009)
16. Trac, S., Puzis, Y., Sutcliffe, G.: An interactive derivation viewer. In: UITP 2006. Electronic Notes in Theoretical Computer Science, vol. 174, pp. 109-123. Elsevier, Amsterdam (2007)
17. Tamaki, H., Sato, T.: Unfold/fold transformations of logic programs. In: Tärnlund, S.-Å. (ed.) Proceedings of The Second International Conference on Logic Programming, pp. 127-139 (1984)
18. Urban, J.: Automated reasoning for mizar: Artificial intelligence through knowledge exchange. In: Rudnicki, P., Sutcliffe, G., Konev, B., Schmidt, R.A., Schulz, S. (eds.) LPAR Workshops. CEUR Workshop Proceedings, vol. 418. CEUR-WS.org (2008)
19. Urban, J., Sutcliffe, G., Pudlák, P., Vyskočil, J.: Malarea sg1- machine learner for automated reasoning with semantic guidance. In: Armando, A., Baumgartner, P., Dowek, G. (eds.) IJCAR 2008. LNCS (LNAI), vol. 5195, pp. 441-456. Springer, Heidelberg (2008)
20. Veroff, R.: Solving open questions and other challenge problems using proof sketches. J. Autom. Reasoning 27(2), 157-174 (2001)
21. Vyskočil, J., Štěpánek, P.: Improving efficiency of prolog programs by fully automated unfold/fold transformation. In: Gelbukh, A., Kuri Morales, Á.F. (eds.) MICAI 2007. LNCS (LNAI), vol. 4827, pp. 305-315. Springer, Heidelberg (2007)