diff --git a/doc/report/applications.tex b/doc/report/applications.tex
index f5f0b926e5b4690bf2b38c45adafa9f3f018c46d..27a5a9c3b4785afcc57ffa47b36dbe2ee0e8bcab 100644
--- a/doc/report/applications.tex
+++ b/doc/report/applications.tex
@@ -114,72 +114,76 @@ proof of concept implementations.
think of another ontology for algorithms. We leave this for later
discussion.
- \item \textbf{$\mathcal{Q}_{3}$ ``Find integer sequences whose generating
- function is a rational polynomial in $\sin(x)$ that has a Maple
- implementation not not affected by the bug in module~$x$.''} We
- see that this query is about finding specific instances, integer
- sequences, with some property.
-
- This is a case where information would be split between many
- sources. The name of the sequences is part of the organizational
- data set, the generating function is part of symbolic knowledge,
- the Maple implementation could be part of concrete knowledge.
-
- Handling this query would probably start by filtering for all
- integer sequences. It is not clear how this should be achieved with
- ULO/RDF as it contains no unified concept of a sequence. It might
- be possible to take advantage of \texttt{aligned-with} or some
- similar concept to find all such sequences. If this succeeds, an
- ULO index can provide the first step in servicing this query.
-
- As for the next steps, finding concrete algorithms and in
- particular looking inside of them is not organizational data and
- other indices will need to be queried. That said, it is an open
- question whether ULO should contain more information (e.g.\ about
- properties of the generating function) or whether such information
- can be deduced from symbolic knowledge.
-
- \item \textbf{$\mathcal{Q}_{4}$ ``CAS implementation of Gröbner bases that
- conform to a definition in AFP.''} Gröbner Bases are a field of
- study in mathematics particular attractive for use in computer
- algebra systems (CAS)~\cite{groebner}. This query is asking for
- concrete implementations of Gröbner Bases that match the definition
- in the Archive of Formal Proofs (AFP).
-
- We do have ULO/RDF exports for the AFP~\cite{uloisabelle}. Stated
- like this, we can probably assume that $\mathcal{Q}_{4}$ is a query
- for a very specific definition, identified by an ULO {URI}. No smart
- queries necessary. What is missing is the set of implementations,
- that is symbolic knowledge about actual implementations, and a way
- of matching this symbolic knowledge with the definition in
- {AFP}. While surely an interesting problem, it is not a task for
- organizational knowledge.
-
- \item \textbf{$\mathcal{Q}_{5}$ ``All areas of math that {Nicolas G.\
- de Bruijn} has worked in and his main contributions.''} This query
- is asking by works of a given author~$A$. It also ask for their
- main contributions, e.g.\ what paragraphs or code~$A$ has authored.
-
- \textbf{Organizational Aspect} ULO has no concept of authors,
- contributors dates and so on. Rather, the idea is to take advantage
- of the Dublin Core project which provides an ontology for such
- metadata~\cite{dcreport, dcowl}. For example, Dublin Core provides
- us with the \texttt{dcterms:creator} predicate. Servicing this
- query would mean looking for the creator~$A$ and then listing all
- associated \texttt{dcterms:title} that~$A$ has worked on. For a
- first working version, the exports managed by \emph{ulo-storage}
- are enough to service this query.
-
- As~$\mathcal{Q}_{5}$ is also asking for the main contributions
- of~$A$, that is those works that~$A$ authored that are the most
- important. Importance is a quality measure, simply sorting the
- result by number of references might be a good start. Again, this
- is something that should serviceable with just organizational
- knowledge.
-
- \textbf{Implementation} Search for contributions by a given author
- can easily be formulated in {SPARQL}.
- \begin{lstlisting}
+ \item \textbf{$\mathcal{Q}_3$ ``Find integer sequences whose
+ generating function is a rational polynomial in $\sin(x)$ that has
+ a Maple implementation not not affected by the bug in
+ module~$x$.''} We see that this query is about finding specific
+ instances, integer sequences, with some property. This is a case
+ where information would be split between many sources. The name
+ of the sequences is part of the organizational data set, the
+ generating function is part of symbolic knowledge, the Maple
+ implementation could be part of concrete knowledge.
+
+ \textbf{Organizational Aspect} Handling this query would probably
+ start by filtering for all integer sequences. It is not clear how
+ this should be achieved with ULO/RDF as it contains no unified
+ concept of a sequence. It might be possible to take advantage
+ of \texttt{aligned-with} or some similar concept to find all such
+ sequences. If this succeeds, an ULO index can provide the first
+ step in servicing this query. Here we are in a similar situation
+ as with~$\mathcal{Q}_2$. It is not clear whether we should
+ represent the idea behind ``integer sequences'' as a native
+ component of ULO or as something building on top of what ULO
+ provides.
+
+ As for the next steps, finding concrete algorithms and in
+ particular looking inside of them is not organizational data and
+ other indices will need to be queried. That said, it is an open
+ question whether ULO should contain more information (e.g.\ about
+ properties of the generating function) or whether such information
+ can be deduced from symbolic knowledge.
+
+ \item \textbf{$\mathcal{Q}_{4}$ ``CAS implementation of Gröbner bases that
+ conform to a definition in AFP.''} Gröbner Bases are a field of
+ study in mathematics particular attractive for use in computer
+ algebra systems (CAS)~\cite{groebner}. This query is asking for
+ concrete implementations of Gröbner Bases that match the definition
+ in the Archive of Formal Proofs (AFP).
+
+ We do have ULO/RDF exports for the AFP~\cite{uloisabelle}. Stated
+ like this, we can probably assume that $\mathcal{Q}_{4}$ is a query
+ for a very specific definition, identified by an ULO {URI}. No smart
+ queries necessary. What is missing is the set of implementations,
+ that is symbolic knowledge about actual implementations, and a way
+ of matching this symbolic knowledge with the definition in
+ {AFP}. While surely an interesting problem, it is not a task for
+ organizational knowledge.
+
+ \item \textbf{$\mathcal{Q}_{5}$ ``All areas of math that {Nicolas G.\
+ de Bruijn} has worked in and his main contributions.''} This query
+ is asking by works of a given author~$A$. It also ask for their
+ main contributions, e.g.\ what paragraphs or code~$A$ has authored.
+
+ \textbf{Organizational Aspect} ULO has no concept of authors,
+ contributors dates and so on. Rather, the idea is to take advantage
+ of the Dublin Core project which provides an ontology for such
+ metadata~\cite{dcreport, dcowl}. For example, Dublin Core provides
+ us with the \texttt{dcterms:creator} predicate. Servicing this
+ query would mean looking for the creator~$A$ and then listing all
+ associated \texttt{dcterms:title} that~$A$ has worked on. For a
+ first working version, the exports managed by \emph{ulo-storage}
+ are enough to service this query.
+
+ As~$\mathcal{Q}_{5}$ is also asking for the main contributions
+ of~$A$, that is those works that~$A$ authored that are the most
+ important. Importance is a quality measure, simply sorting the
+ result by number of references might be a good start. Again, this
+ is something that should serviceable with just organizational
+ knowledge.
+
+ \textbf{Implementation} Search for contributions by a given author
+ can easily be formulated in {SPARQL}.
+ \begin{lstlisting}
PREFIX ulo: <https://mathhub.info/ulo#>
PREFIX dcterms: <http://purl.org/dc/terms/>
@@ -188,13 +192,13 @@ proof of concept implementations.
?work dcterms:contributor "John Smith" .
}
GROUP BY ?work
- \end{lstlisting}
- To get all main contributions, we rate each
- individual \texttt{?work} by its number of \texttt{ulo:uses}
- references. Extending the {SPARQL} query, we can query the database
- for a ordered list of works, starting with the one that has the
- most references.
- \begin{lstlisting}
+ \end{lstlisting}
+ To get all main contributions, we rate each
+ individual \texttt{?work} by its number of \texttt{ulo:uses}
+ references. Extending the {SPARQL} query, we can query the database
+ for a ordered list of works, starting with the one that has the
+ most references.
+ \begin{lstlisting}
PREFIX ulo: <https://mathhub.info/ulo#>
PREFIX dcterms: <http://purl.org/dc/terms/>