Publishing Math Lecture Notes as Linked DataESWC 2010 (Demo Track)

Catalin David1 andMichael Kohlhase1 and Christoph Lange1 andFlorian Rabe1 and Nikita Zhiltsov2 and Vyacheslav Zholudev1

1 Jacobs University, Bremen, GermanyKWARC – Knowledge Adaptation and Reasoning for Content

2Kazan 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

Origin: 2,000 slides + 1,000 homework problems

\begin{frame}

\frametitle{Properties of binary Relations}

\begin{itemize}

\item \textbf{Definition 37} A relation $R\subseteq A\times A$

is called \emph{reflexive} on $A$,

iff $\forall a\in A.\langle a,a\rangle\in 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 onany 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

Origin: 2,000 slides + 1,000 homework problems

\begin{frame}

\frametitle{Properties of binary Relations}

\begin{itemize}

\item \textbf{Definition 37} A relation $R\subseteq A\times A$

is called \emph{reflexive} on $A$,

iff $\forall a\in A.\langle a,a\rangle\in 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 onany 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

Serve Information Needs . . .

. . . of Students⊧ – what’s that!?structural induction – any example for that?sample exercises for last week’s topics?

. . . of Lecturersa good ‘next topic’ (with minimal prerequisites)introduce trees to students: operating systems background vs.graph theory backgroundexam 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

Serve Information Needs . . .

. . . of Students⊧ – what’s that!?structural induction – any example for that?sample exercises for last week’s topics?

. . . of Lecturersa good ‘next topic’ (with minimal prerequisites)introduce trees to students: operating systems background vs.graph theory backgroundexam 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

Our Semantic Architecture

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

sTEX: Semantically extended LATEX

\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

TNTBase: A versioned database for XML

From sTEX, we generate (semi-)automaticallyOMDoc (intermediate semantic XML representation),and from that:

RDF (structural outlines of documents)→ Virtuoso triple storehuman-readable documents with semantic annotationsXHTML+MathML+RDFa

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

TNTBase: A versioned database for XML

From sTEX, we generate (semi-)automaticallyOMDoc (intermediate semantic XML representation),and from that:

RDF (structural outlines of documents)→ Virtuoso triple storehuman-readable documents with semantic annotationsXHTML+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

Querying RDF

Mocassin query input form: OMDoc-aware SPARQL and full-textqueries

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

Querying RDF

Mocassin query input form: OMDoc-aware SPARQL and full-textqueries

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

Interactive Documents

Semantic annotations in XHTML+MathML+RDFa documents serveas anchors for services

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

Next steps (in progress)

from 3,000 manually annotated lecture notes to 300,000automatically annotated arχiv publicationsadd links to linked datasets (e. g. DBpedia) to our lecture notescontribute our dataset to the LOD cloudbenefit from cross-linking

Publishing Math Lecture Notes as Linked Datahttp://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