Logosphere.
A Formal Digital Library.

 

Department of Computer Science
Yale University
51 Prospect St.
New Haven, CT 06520-8285
U.S.A.
 


  Home
 

Workshop Program (June 9, 2004), Room 7220

9:00 Intro and Logosphere Overview and Challenges (Schuermann)
9:30 HOL-light & Flyspec (Hales and/or McLaughlin), (45 minutes + discussion)
10:30 FDL Overview and Challenges (Constable and/or Allen), (45 minutes + discussion)
11:30 PVS Overview and Challenges (Shankar and/or Owre), (45 minutes + discussion)
12:30 Lunch
1:30 Proof compression (Pfenning and/or Reed) (30+discussion)
2:15 Encoding of PVS in Twelf (Schuermann and/or Sarnat) (30+discussion)
3:00

Experiments and Results of FDL (30+discussion)

A Graph-Based Approach towards Discerning Inherent Structures
in a Digital Library of Formal Mathematics.
Speaker: Lori Lorigo, PhD Candidate

As the amount of online formal mathematical content grows, for example through active efforts such as Logosphere, Mathweb, Cornell's Formal Digital Library (FDL), and others, it becomes increasingly valuable to find automated means to manage this data and capture semantics such as relatedness and significance. In this talk, I discuss results from applying graph-based approaches, such as HITS, or Hyperlink-Induced Topic Selection, used for World Wide Web document search and analysis, to formal mathematical data collections. The nodes of the graphs analyzed are theorems and definitions, and the links are logical dependencies. By exploiting this link structure, I show how one may extract organizational and relatedness information from a collection of digital formal math. This work was done in collaboration with Jon Kleinberg, Robert Constable, and Richard Eaton.

3:45 Special working groups/planning sessions depending on earlier discussion or results.
4:30 Logosphere PI meeting