From 881025c3f1e1a1ca763e5bc3a68eb0e8bf3a4534 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Andreas=20Sch=C3=A4rtl?= <andreas@schaertl.me>
Date: Thu, 25 Jun 2020 15:04:46 +0200
Subject: [PATCH] report: write down proposed queries for tetrapodal search
---
doc/report/applications.tex | 53 +++++++++++++++++++++++++++++++++++++
doc/report/collecter.tex | 1 +
doc/report/components.tex | 1 +
doc/report/conclusion.tex | 1 +
doc/report/endpoints.tex | 1 +
5 files changed, 57 insertions(+)
diff --git a/doc/report/applications.tex b/doc/report/applications.tex
index 48fc3b5..aec7f41 100644
--- a/doc/report/applications.tex
+++ b/doc/report/applications.tex
@@ -1,3 +1,4 @@
+\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}
diff --git a/doc/report/collecter.tex b/doc/report/collecter.tex
index 6381f3f..cdbbc49 100644
--- a/doc/report/collecter.tex
+++ b/doc/report/collecter.tex
@@ -1,2 +1,3 @@
+\newpage
\section{Collecter and Importer}\label{sec:collecter}
diff --git a/doc/report/components.tex b/doc/report/components.tex
index 9deca86..ae40361 100644
--- a/doc/report/components.tex
+++ b/doc/report/components.tex
@@ -1,3 +1,4 @@
+\newpage
\section{Components}\label{sec:components}
With ULO/RDF files in place and available for download on
diff --git a/doc/report/conclusion.tex b/doc/report/conclusion.tex
index f01b33d..be84118 100644
--- a/doc/report/conclusion.tex
+++ b/doc/report/conclusion.tex
@@ -1 +1,2 @@
+\newpage
\section{Conclusion and Future Work}\label{sec:conclusion}
diff --git a/doc/report/endpoints.tex b/doc/report/endpoints.tex
index 2206d2f..ebc6ed6 100644
--- a/doc/report/endpoints.tex
+++ b/doc/report/endpoints.tex
@@ -1,3 +1,4 @@
+\newpage
\section{Endpoints}\label{sec:endpoints}
With ULO/RDF triplets imported into a database, in our case GraphDB,
--
GitLab