report: [x] implement Q3

doc/report/applications.tex

@@ -114,23 +114,27 @@ 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.
+    \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