Advertisement

A Graph-Based Approach Towards Discerning Inherent Structures in a Digital Library of Formal Mathematics

  • Lori Lorigo
  • Jon Kleinberg
  • Richard Eaton
  • Robert Constable
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3119)

Abstract

As the amount of online formal mathematical content grows, for example through active efforts such as the Mathweb [21], MOWGLI [4], Formal Digital Library, or FDL [1], and others, it becomes increasingly valuable to find automated means to manage this data and capture semantics such as relatedness and significance. We apply graph-based approaches, such as HITS, or Hyperlink Induced Topic Search, [11] used for World Wide Web document search and analysis, to formal mathematical data collections. The nodes of the graphs we analyze are theorems and definitions, and the links are logical dependencies. By exploiting this link structure, we show how one may extract organizational and relatedness information from a collection of digital formal math. We discuss the value of the information we can extract, yielding potential applications in math search tools, theorem proving, and education.

Keywords

Digital Library Dependency Graph Logical Dependency List Theory Interactive Theorem Prover 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Allen, S., Bickford, M., Constable, R., Eaton, R., Kreitz, C., Lorigo, L.: FDL: A Prototype Formal Digital Library. Cornell University (2002) (unpublished manuscript)Google Scholar
  2. 2.
    Allen, S., Constable, R., Eaton, R., Kreitz, C., Lorigo, L.: The Nuprl Open Logical Environment. In: McAllester, D. (ed.) CADE 2000. LNCS, vol. 1831, pp. 170–176. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  3. 3.
    Asperti, A., Padovani, L., Sacerdoti Coen, C., Guidi, F., Schena, I.: Mathematical Knowledge Management in HELM. In: Annals of Mathematics and Artificial Intelligence, Special Issue on Mathematical Knowledge Management, vol. 38(1-3), pp. 1012–2443. Kluwer Academic Publishers, Dordrecht (2003)Google Scholar
  4. 4.
    Asperti, A., Wegner, B.: MOWGLI: A New Approach for the Content Description in Digital Documents. In: Ninth International Conference “Crimea 2002” Libraries and Associations in the Transient World: New Technologies and New Forms of Cooperation (2002)Google Scholar
  5. 5.
    Barabasi, A.: Linked: How Everything Is Connected to Everything Else and What It Means. Plume Books (2003)Google Scholar
  6. 6.
    Batagelj, V., Mrvar, A.: PAJEK, Program for Large Network Analysis, http://vlado.fmf.uni-lj.si/pub/networks/pajek/
  7. 7.
    Bertot, Y., Pons, O.: Dependency graphs in Interactive Theorem Provers. INRIA Tech. Report (2000)Google Scholar
  8. 8.
    Bickford, M., Constable, R.: A Logic of Events. Cornell University Technical Report 2003-1893 (2003)Google Scholar
  9. 9.
    Brin, S., Page, L.: The anatomy of a large-scale hypertextual (Web) search engine. In: Seventh International World Wide Web Conference (1998)Google Scholar
  10. 10.
    Broder, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., Wiener, J.: Graph structure in the web. In: 9th International World Wide Web Conference (2000)Google Scholar
  11. 11.
    Kleinberg, J.: Authoritative Sources in a Hyperlinked Environment. In: Proc. 9th ACM-SIAM Symposium on Discrete Algorithms (1998)Google Scholar
  12. 12.
    Kumar, R., Raghavan, P., Rajagopalan, S., Tomkins, A.: Trawling the Web for cyber communities. Computer Networks 31, 1481–1493 (1999)CrossRefGoogle Scholar
  13. 13.
    Kohlhase, M.: OMDoc: Towards an Internet Standard for the Administration, Distribution and Teaching of mathematical Knowledge. In: Proceedings of Artificial Intelligence and Symbolic Computation. LNCS (LNAI). Springer, Heidelberg (2001)Google Scholar
  14. 14.
    Kohlhase, M.: OMDoc: An Infrastructure for OpenMath Content Dictionary Information. Bulletin of the ACM Special Interest Group for Algorithmic Mathematics, SIGSAM (2000)Google Scholar
  15. 15.
    Lozier, D.: The DLMF Project: A New Initiative in Classical Special Functions. In: Proc. International Workshop on Special Functions - Asymptotics, Harmonic Analysis and Mathematical Physics, Hong Kong (1999)Google Scholar
  16. 16.
    Mathematical Markup Language (MathML) 2.0, W3C Recommendation (February 21, 2001), http://www.w3.org/TR/MathML2/
  17. 17.
    Newman, M., Girvan, M.: Finding and evaluating community structure in networks. Physical Review E 69, 26113 (2004)Google Scholar
  18. 18.
    Newman, M., Park, J.: Why social networks are different from other types of networks. Physical Review E 68, 036122 (2003)Google Scholar
  19. 19.
    Ng, A., Zheng, A., Jordan, M.: Stable Algorithms for Link Analysis. In: Proc. 24th Annual Intl. ACM SIGIR Conference (2001)Google Scholar
  20. 20.
    PRL Group, Department of Computer Science, Cornell University, http://www.nuprl.org/Nuprl4.2/Libraries/Welcome.html
  21. 21.
    Zimmer, J., Kohlhase, M.: System Description: The MathWeb Software Bus for Distributed Mathematical Reasoning. In: Voronkov, A. (ed.) CADE 2002. LNCS (LNAI), vol. 2392. Springer, Heidelberg (2002)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Lori Lorigo
    • 1
  • Jon Kleinberg
    • 1
  • Richard Eaton
    • 1
  • Robert Constable
    • 1
  1. 1.Department of Computer ScienceCornell UniversityIthacaUSA

Personalised recommendations