report: write down proposed queries for tetrapodal search

doc/report/applications.tex

+\newpage
 \section{Applications}\label{sec:applications}
 
 With endpoints in place, we can now query the ULO/RDF
@@ -51,3 +52,55 @@ that (1)~the query language is intuitive and easy to use for this
 specific use case and (2)~execution is still fast as the underlying
 SPARQL database is already very optimized.
 
+% This does not really fit, in general this entire section is kind
+% of a mess and contains more stuff about things that do not even
+% exist yet than actual information.
+
+\subsection{Querying for Tetrapodal Search}
+
+The first introduction of tetrapodal search contains various queries
+that such a system should answer~\cite{tetra}. For each of the
+suggested queries, we experimented how well ULO/RDF can answer this
+queries. As \emph{ulo-storage} provides only one of the four required
+kinds of mathematical knowledge required by tetrapodal search, not all
+queries could be answered. They are replicated here in verbatim.
+
+\begin{enumerate}
+
+\item Find theorems with non-elementary proofs.
+
+\item Find algorithms that solve $NP$-complete graph problems.
+
+\item Find integer sequences whose generating function is a rational
+  polynomial in $\sin(x)$ that has a Maple implementation not affected
+  by the bug in module~$x$.
+
+\item $CAS$ implementation of Groebner bases that conform to a
+  definition in AFP.
+
+\item Find all group representations that are good for~$X$ (say a
+  software engineer working on something and doesn't know group
+  theory), maybe ``computing with in/finite groups''.
+
+\item Math software systems that implement algorithms from MSC48CXX
+  (or that compute a particular thing).
+
+\item All areas of math that {Nicolas G.\ de Bruijn} has worked in and
+  his main contributions.
+
+\item All the researchers that have worked on problem~$X$ (where~$X$
+  does not have a good name, maybe connected to ``Go'').
+
+\item Areas of mathematics that immediate descendants of~$X$ worked
+  on.
+
+\item All graphs whose order is larger than the publication record of
+  its ``inventor'' (name patron).
+
+\item Integer sequences that grow sub-exponentially.
+
+\item Published integer sequences not listed in the OEIS.
+
+\item Find all polynomials whose list of coefficients occurs as a
+  subsequence of a specific OEIS sequence.
+\end{enumerate}

doc/report/collecter.tex

+\newpage
 \section{Collecter and Importer}\label{sec:collecter}
 

doc/report/components.tex

+\newpage
 \section{Components}\label{sec:components}
 
 With ULO/RDF files in place and available for download on

doc/report/conclusion.tex

+\newpage
 \section{Conclusion and Future Work}\label{sec:conclusion}

doc/report/endpoints.tex

+\newpage
 \section{Endpoints}\label{sec:endpoints}
 
 With ULO/RDF triplets imported into a database, in our case GraphDB,