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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Allen, S., Bickford, M., Constable, R., Eaton, R., Kreitz, C., Lorigo, L.: FDL: A Prototype Formal Digital Library. Cornell University (2002) (unpublished manuscript)
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)
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)
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)
Barabasi, A.: Linked: How Everything Is Connected to Everything Else and What It Means. Plume Books (2003)
Batagelj, V., Mrvar, A.: PAJEK, Program for Large Network Analysis, http://vlado.fmf.uni-lj.si/pub/networks/pajek/
Bertot, Y., Pons, O.: Dependency graphs in Interactive Theorem Provers. INRIA Tech. Report (2000)
Bickford, M., Constable, R.: A Logic of Events. Cornell University Technical Report 2003-1893 (2003)
Brin, S., Page, L.: The anatomy of a large-scale hypertextual (Web) search engine. In: Seventh International World Wide Web Conference (1998)
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)
Kleinberg, J.: Authoritative Sources in a Hyperlinked Environment. In: Proc. 9th ACM-SIAM Symposium on Discrete Algorithms (1998)
Kumar, R., Raghavan, P., Rajagopalan, S., Tomkins, A.: Trawling the Web for cyber communities. Computer Networks 31, 1481–1493 (1999)
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)
Kohlhase, M.: OMDoc: An Infrastructure for OpenMath Content Dictionary Information. Bulletin of the ACM Special Interest Group for Algorithmic Mathematics, SIGSAM (2000)
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)
Mathematical Markup Language (MathML) 2.0, W3C Recommendation (February 21, 2001), http://www.w3.org/TR/MathML2/
Newman, M., Girvan, M.: Finding and evaluating community structure in networks. Physical Review E 69, 26113 (2004)
Newman, M., Park, J.: Why social networks are different from other types of networks. Physical Review E 68, 036122 (2003)
Ng, A., Zheng, A., Jordan, M.: Stable Algorithms for Link Analysis. In: Proc. 24th Annual Intl. ACM SIGIR Conference (2001)
PRL Group, Department of Computer Science, Cornell University, http://www.nuprl.org/Nuprl4.2/Libraries/Welcome.html
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lorigo, L., Kleinberg, J., Eaton, R., Constable, R. (2004). A Graph-Based Approach Towards Discerning Inherent Structures in a Digital Library of Formal Mathematics. In: Asperti, A., Bancerek, G., Trybulec, A. (eds) Mathematical Knowledge Management. MKM 2004. Lecture Notes in Computer Science, vol 3119. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27818-4_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-27818-4_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23029-8
Online ISBN: 978-3-540-27818-4
eBook Packages: Springer Book Archive