Publication/Citation: A Proof-Theoretic Approach to Mathematical Knowledge Management*

Chapter
Part of the Synthese Library book series (SYLI, volume 353)

Abstract

There are many real-life examples of formal systems that support certain constructions or proofs, but that do not provide direct support for remembering them so that they can be recalled and reused the future. This task is usually left to some metasystem that is typically provided as an afterthought. For example, programming language design usually focuses on the programming language itself; the mechanism for accumulating useful code in libraries is considered more of a systems issue and is generally treated as a separate design task. Mathematics deals with the construction of proofs, but not with their publication and citation; that is the domain of the journals.

Keywords

Proof System Deduction System Individual Term Elimination Rule Universal Closure 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Notes

Acknowledgements

We are indebted to Kamal Aboul-Hosn, Samson Abramsky, Terese Damhøj Andersen, and Anil Nerode for valuable ideas and comments. This work was supported in part by NSF grant CCF-0635028. Any views and conclusions expressed herein are those of the authors and do not necessarily represent the official policies or endorsements of the National Science Foundation or the United States government.

References

  1. 1.
    K. Aboul-Hosn. A proof-theoretic approach to tactics. In J.M. Borwein and W.M. Farmer, editors, Proceedings of the 5th International Conference on Mathematical Knowledge Management (MKM’06), volume 4108 of Lecture Notes in Computer Science, pages 54–66. Springer, Berlin, Germany, August 2006.CrossRefGoogle Scholar
  2. 2.
    K. Aboul-Hosn. A Proof-Theoretic Approach to Mathematical Knowledge Management. PhD thesis, Cornell University, January 2007.Google Scholar
  3. 3.
    K. Aboul-Hosn and T.D. Andersen. A proof-theoretic approach to hierarchical math library organization. In Proceedings of the 4th International Conference on Mathematical Knowledge Management (MKM’05), pages 1–16. Springer, Berlin, Germany, October 2005.Google Scholar
  4. 4.
    S. Allen, M. Bickford, R. Constable, R. Eaton, C. Kreitz, and L. Lorigo. FDL: A prototype formal digital library, 2002. http://www.nuprl.org/FDLproject/02cucs-fdl.html
  5. 5.
    B. Buchberger. Mathematical knowledge management using theorema. In B. Buchberger, O. Caprotti, editors, 1st International Conference on Mathematical Knowledge Management (MKM 2001), RISC-Linz, A-4232 Schloss Hagenberg, Austria, September 24–26, 2001.Google Scholar
  6. 6.
    R.L. Constable, S.F. Allen, H.M. Bromley, W.R. Cleaveland, J.F. Cremer, R.W. Harper, D.J. Howe, T.B. Knoblock, N.P. Mendler, P. Panangaden, J.T. Sasaki, and S.F. Smith. Implementing Mathematics with the Nuprl Development System. Prentice-Hall, Englewood Cliffs, NJ, 1986.Google Scholar
  7. 7.
    A. Felty and D. Howe. Generalization and reuse of tactic proofs. In Proceedings of the 5th International Conference on Logic Programming and Automated Reasoning (LPAR94). Springer, Berlin, Germany, 1994.Google Scholar
  8. 8.
    D. Hutter. Structuring deduction by using abstractions. In T. Ellman, editor, Proceedings of the International Symposion on Abstraction, Reformulation, and Approximation (SARA98), pages 72–78. Pacific Grove, CA, 1998.Google Scholar
  9. 9.
    D. Hutter. Annotated reasoning. Annals of Mathematics and Artificial Intelligence, Special Issue on Strategies in Automated Deduction, 29:183–222, 2000.CrossRefGoogle Scholar
  10. 10.
    T. Kolbe and C. Walther. Reusing proofs. In Proceedings of the 11th European Conference on Artificial Intelligence (ECAI-11), pages 80–84. Seattle, WA, May 21–23, 1994.Google Scholar
  11. 11.
    T. Kolbe and C. Walther. Proof management and retrieval. In Proceedings of the Workshop on Formal Approaches to the Reuse of Plans, Proofs and Programs (IJCAI-14). Montreal, CA, 1995.Google Scholar
  12. 12.
    E. Melis and J. Whittle. Analogy in inductive theorem proving. Journal of Automated Reasoning, 22(2):117–147, 1999.CrossRefGoogle Scholar
  13. 13.
    F. Piroi and B. Buchberger. An environment for building mathematical knowledge libraries. In A. Trybulec, A. Asperti, G. Bancerek, editor, Proceedings of the 3rd International Conference Mathematical Knowledge Management (MKM 2004), volume 3119 of Lecture Notes in Computer Science. Springer, Berlin, Germany, September 2004.Google Scholar
  14. 14.
    A. Schairer. A Technique for Reusing Proofs in Software Verification. PhD thesis, FB 14 (Informatik) der Universität des Saarlandes und Institut A für Mechanik der Universität Stuttgart, Stuttgart, AT, 1998.Google Scholar
  15. 15.
    A. Schairer, S. Autexier, and D. Hutter. A pragmatic approach to reuse in tactical theorem proving. Electronic Notes in Theoretical Computer Science, 58(2), 2001.Google Scholar
  16. 16.
    A. Trybulec. The Mizar system. http://mizar.uwb.edu.pl/system/

Copyright information

© Springer Science+Business Media B.V. 2011

Authors and Affiliations

  1. 1.Department of Computer ScienceCornell UniversityIthacaUSA

Personalised recommendations