A proof-theoretic approach to mathematical knowledge management

作者: Kamal Aboul-Hosn , Dexter Kozen

DOI:

关键词:

摘要: Mathematics is an area of research that forever growing. Definitions, theorems, axioms, and proofs are integral part every mathematics. The relationships between these elements bring to light the elegant abstractions bind even most intricate aspects math science. As body mathematics becomes larger its become richer, organization mathematical knowledge more important difficult. This emerging referred as management (MKM). primary issues facing MKM were summarized by Buchberger, one organizers first Mathematical Knowledge Management Workshop [20]. (1) How do we retrieve from existing future sources? (2) How build bases? (3) How make bases available mathematicians? These questions have particularly relevant with growing power interest in automated theorem proving, using computer programs prove theorems. Automated provers been used formalize theorems all areas mathematics, resulting large libraries knowledge. However; usually implemented at system level, meaning they not defined same level formalism themselves, which rely on a strong underlying proof theory rules for their creation. In this thesis, develop proof-theoretic approach formalizing library way steps formalized provers. formal exhibits five desirable properties: independence, structure, formalism, adaptability, presentability. ultimate goal vast information people skill levels. thesis provides foundation realizing goal.

参考文章(82)
Fausto Giunchiglia, Adolfo Villafiorita, Toby Walsh, Theories of abstraction Ai Communications. ,vol. 10, pp. 167- 176 ,(1997)
Robert E. Kling, A paradigm for reasoning by analogy international joint conference on artificial intelligence. pp. 568- 585 ,(1971)
Dexter Kozen, Allegra Angus, Kleene Algebra with Tests and Program Schematology Cornell University. ,(2001)
Thomas Kolbe, Christoph Walther, Patching Proofs for Reuse (Extended Abstract) european conference on machine learning. pp. 303- 306 ,(1995) , 10.1007/3-540-59286-5_73
Jaime G. Carbonell, Derivational analogy: a theory of reconstructive problem solving and expertise acquisition Morgan Kaufmann Publishers Inc.. pp. 727- 738 ,(1993)
Lori Lorigo, Jon Kleinberg, Richard Eaton, Robert Constable, A Graph-Based Approach Towards Discerning Inherent Structures in a Digital Library of Formal Mathematics Lecture Notes in Computer Science. pp. 220- 235 ,(2004) , 10.1007/978-3-540-27818-4_16
Erica Melis, A model of analogy-driven proof-plan construction international joint conference on artificial intelligence. pp. 182- 188 ,(1995)
David A. Plaisted, Abstraction using generalization functions conference on automated deduction. pp. 365- 376 ,(1986) , 10.1007/3-540-16780-3_103
Gertrud Bauer, Markus Wenzel, Calculational Reasoning Revisited (An Isabelle/Isar Experience) theorem proving in higher order logics. pp. 75- 90 ,(2001) , 10.1007/3-540-44755-5_7
Teri Anderson, Shelly R. Lesher, Theresa Dust, Dean Johnson, The Growth of Physics and Mathematics IU South Bend Undergraduate Research Journal. ,vol. 2, pp. 1- 6 ,(1999)