The document describes a project to publish mathematics lecture notes as linked data. Key points: 1) Lecture notes containing 2,000 slides and 1,000 homework problems were semantically annotated and converted to RDF to create structured data. 2) The RDF is stored in a triplestore and can be queried with an OMDoc-aware SPARQL endpoint or full-text search. 3) Annotations in the human-readable XHTML documents link to services for interactivity. The goal is to scale this to 300,000 annotated publications and link to external datasets.

1. Publishing Math Lecture Notes as Linked Data
ESWC 2010 (Demo Track)
Catalin David1 and Michael Kohlhase1 and Christoph Lange1 and
Florian Rabe1 and Nikita Zhiltsov2 and Vyacheslav Zholudev1
1 Jacobs University, Bremen, Germany
KWARC – Knowledge Adaptation and Reasoning for Content
2 Kazan Federal University, Russia
May 31, 2010
David/Kohlhase/Lange/Rabe/Zhiltsov/Zholudev (Jacobs/Kazan U.) Publishing Math Lecture Notes as Linked Data May 31, 2010 1/10

2. Origin: 2,000 slides + 1,000 homework problems
begin{frame}
frametitle{Properties of binary Relations}
begin{itemize}
item textbf{Definition 37} A relation $Rsubseteq Atimes A$
is called emph{reflexive} on $A$,
iff $forall ain A.langle a,aranglein R$
item textbf{Example 38} The equality relation is an
equivalence relation on any set.
David/Kohlhase/Lange/Rabe/Zhiltsov/Zholudev (Jacobs/Kazan U.) Publishing Math Lecture Notes as Linked Data May 31, 2010 2/10

3. Origin: 2,000 slides + 1,000 homework problems
begin{frame}
frametitle{Properties of binary Relations}
begin{itemize}
item textbf{Definition 37} A relation $Rsubseteq Atimes A$
is called emph{reflexive} on $A$,
iff $forall ain A.langle a,aranglein R$
item textbf{Example 38} The equality relation is an
equivalence relation on any set.
Definition 37 A relation R ⊆ A × A is called reflexive on A, iff
∀a ∈ A. a, a ∈ R.
...
Example 38 The equality relation is an equivalence relation on
any set.
PDF looks good, but otherwise. . . ?
David/Kohlhase/Lange/Rabe/Zhiltsov/Zholudev (Jacobs/Kazan U.) Publishing Math Lecture Notes as Linked Data May 31, 2010 2/10

4. Serve Information Needs . . .
. . . of Students
– what’s that!?
structural induction – any example for that?
sample exercises for last week’s topics?
David/Kohlhase/Lange/Rabe/Zhiltsov/Zholudev (Jacobs/Kazan U.) Publishing Math Lecture Notes as Linked Data May 31, 2010 3/10

5. Serve Information Needs . . .
. . . of Students
– what’s that!?
structural induction – any example for that?
sample exercises for last week’s topics?
. . . of Lecturers
a good ‘next topic’ (with minimal prerequisites)
introduce trees to students: operating systems background vs.
graph theory background
exam exercises with a good coverage
David/Kohlhase/Lange/Rabe/Zhiltsov/Zholudev (Jacobs/Kazan U.) Publishing Math Lecture Notes as Linked Data May 31, 2010 3/10

6. Our Semantic Architecture
David/Kohlhase/Lange/Rabe/Zhiltsov/Zholudev (Jacobs/Kazan U.) Publishing Math Lecture Notes as Linked Data May 31, 2010 4/10

7. sTEX: Semantically extended LTEX
A
begin{module}[id=relation-properties]
importmodule{relations}
begin{frame}
frametitle{Properties of binary Relations}
begin{itemize}
item begin{definition}[id=relprops.def]
A relation $sseteq{R}{cart{A,A}}$ is called
defin{reflexive} on $A$,
iff $foralS{a}A{inset{tup{a,a}}{R}}$
end{definition}
item begin{example}[for=relprops.def]
The equality relation is an equivalence relation on any set.
end{example}
David/Kohlhase/Lange/Rabe/Zhiltsov/Zholudev (Jacobs/Kazan U.) Publishing Math Lecture Notes as Linked Data May 31, 2010 5/10

8. TNTBase: A versioned database for XML
From sTEX, we generate (semi-)automatically
OMDoc (intermediate semantic XML representation),
and from that:
RDF (structural outlines of documents) → Virtuoso triple store
human-readable documents with semantic annotations
XHTML+MathML+RDFa
David/Kohlhase/Lange/Rabe/Zhiltsov/Zholudev (Jacobs/Kazan U.) Publishing Math Lecture Notes as Linked Data May 31, 2010 6/10

9. TNTBase: A versioned database for XML
From sTEX, we generate (semi-)automatically
OMDoc (intermediate semantic XML representation),
and from that:
RDF (structural outlines of documents) → Virtuoso triple store
human-readable documents with semantic annotations
XHTML+MathML+RDFa
(all served in compliance with Linked Data best practices)
David/Kohlhase/Lange/Rabe/Zhiltsov/Zholudev (Jacobs/Kazan U.) Publishing Math Lecture Notes as Linked Data May 31, 2010 7/10

10. Querying RDF
Mocassin query input form: OMDoc-aware SPARQL and full-text
queries
David/Kohlhase/Lange/Rabe/Zhiltsov/Zholudev (Jacobs/Kazan U.) Publishing Math Lecture Notes as Linked Data May 31, 2010 8/10

11. Querying RDF
Mocassin query input form: OMDoc-aware SPARQL and full-text
queries
Want more? → SPARQL endpoint
David/Kohlhase/Lange/Rabe/Zhiltsov/Zholudev (Jacobs/Kazan U.) Publishing Math Lecture Notes as Linked Data May 31, 2010 8/10

12. Interactive Documents
Semantic annotations in XHTML+MathML+RDFa documents serve
as anchors for services
David/Kohlhase/Lange/Rabe/Zhiltsov/Zholudev (Jacobs/Kazan U.) Publishing Math Lecture Notes as Linked Data May 31, 2010 9/10

13. Next steps (in progress)
from 3,000 manually annotated lecture notes to 300,000
automatically annotated arχiv publications
add links to linked datasets (e. g. DBpedia) to our lecture notes
contribute our dataset to the LOD cloud
benefit from cross-linking
Publishing Math Lecture Notes as Linked Data
http://kwarc.info/LinkedLectures/
See the demo tonight!
David/Kohlhase/Lange/Rabe/Zhiltsov/Zholudev (Jacobs/Kazan U.) Publishing Math Lecture Notes as Linked Data May 31, 2010 10/10