Publishing Math Lecture Notes as Linked Data ESWC 2010 (Demo Track) Catalin David 1 and Michael Kohlhase 1 and Christoph Lange 1 and Florian Rabe 1 and Nikita Zhiltsov 2 and Vyacheslav Zholudev 1 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
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
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
\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
\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
. . . 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
. . . 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
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