Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
A
alignment-finder
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Container registry
Model registry
Operate
Environments
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Terms and privacy
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
OAF
alignment-finder
Commits
fafbac5d
Commit
fafbac5d
authored
7 years ago
by
Dennis Müller
Browse files
Options
Downloads
Patches
Plain Diff
structuring
parent
6b983337
No related branches found
No related tags found
No related merge requests found
Changes
5
Hide whitespace changes
Inline
Side-by-side
Showing
5 changed files
tex/intro.tex
+67
-0
67 additions, 0 deletions
tex/intro.tex
tex/paper.tex
+8
-72
8 additions, 72 deletions
tex/paper.tex
tex/prelim.tex
+1
-0
1 addition, 0 deletions
tex/prelim.tex
tex/usecase.tex
+0
-0
0 additions, 0 deletions
tex/usecase.tex
tex/viewfinder.tex
+0
-0
0 additions, 0 deletions
tex/viewfinder.tex
with
76 additions
and
72 deletions
tex/intro.tex
0 → 100644
+
67
−
0
View file @
fafbac5d
``Semantic Search'' -- a very suggestive term, which is alas seriously under-defined --
has often been touted as the ``killer application'' of semantic technologies. With a view
finder, we can add another possible interpretation: searching mathematical ontologies
(here modular theorem prover libraries) at the level of theories -- we call this
\defemph
{
theory
classification
}
.
The basic use case is the following: Jane, a mathematician, becomes interested in a class
of mathematical objects, say -- as a didactic example -- something she initially calls
``beautiful subsets'' of a base set
$
\cB
$
(or just ``beautiful over
$
\cB
$
''). These have
the following properties:
\begin{compactenum}
\item
the empty set is beautiful over
$
\cB
$
\item
every subset of a beautiful set is beautiful over
$
\cB
$
\item
If
$
A
$
and
$
B
$
are beautiful over
$
\cB
$
and
$
A
$
has more elements than
$
B
$
, then
there is an
$
x
\in
A
\backslash
B
$
, such that
$
B
\cup\{
x
\}
$
is beautiful over
$
\cB
$
.
\end{compactenum}
To see what is known about beautiful sets, she types these three conditions into a theory
classifier, which interprets them as a
\MMT
theory
$
Q
$
, computes all (total) views from
$
Q
$
into a library
$
\cL
$
, and returns presentations of target theories and the assignments
made by the views. In our example we have the situation in
Figure~
\ref
{
fig:theory-classification-ex
}
\ednote
{
MK: Maybe better do this in jEdit and use
screenshots
}
\ednote
{
Interesting: the
$
\emptyset
$
clause could also be ``
$
\exists
S
$
beautiful'', which is equivalent via the subset clause, maybe use that in the example:
define Matroid with that and have a theorem that says that
$
\emptyset
$
is beautiful. Just
see what the viewfinder catches.
}
In the base use case, Jane learns that her
``beautiful sets'' correspond to the well-known structure of
matroids~
\cite
{
wikipedia:matroid
}
, so she can directly apply matroid theory to her
problems.
\begin{newpart}
{
MK: this could/should be extended
}
In extended use cases, we could
\begin{compactitem}
\item
use partial views to find theories that share significant structure with
$
Q
$
, so
that we can formalize
$
Q
$
with modularly with minimal effort. Say Jane was interested in
``dazzling subsets'', i.e. beautiful subsets that obey a fourth condition, then she
could just contribute a theory that extends
\textsf
{
matroid
}
by a formalization of the
fourth condition -- and maybe rethink the name.
\item
use existing views in
$
\cL
$
(compositions of views are vivews) to give Jane more
information about her beautiful subsets, e.g. that matroids (and thus beautiful sets)
form a generalization of the notion of linear independence from linear algebra.
\end{compactitem}
\end{newpart}
\begin{figure}
[ht]
\centering\lstset
{
aboveskip=0pt,belowskip=0pt
}
\begin{tabular}
{
|p
{
5cm
}
|p
{
5cm
}
|
}
\hline
$
Q
$
&
Result
\\\hline
\begin{lstlisting}
[mathescape]
theory query : F?MitM
include ?set
Base :
{
A
}
set A
beautiful
{
A
}
set A
$
\rightarrow
$
prop
empty :
$
\vdash
$
beautiful
$
\emptyset
$
subset-closed:
$
\vdash
$
{}
\end{lstlisting}
&
\begin{lstlisting}
[mathescape]
theory matroid : F?MitM
include ?baseset
independent
{
A
}
set A
$
\rightarrow
$
empty:
$
\vdash
$
hereditary :
$
\vdash
$
augmentation:
$
\vdash
$
\end{lstlisting}
\\\hline
\end{tabular}
\caption
{
Theory Classification for beautiful sets
}
\label
{
fig:theory-classification-ex
}
\end{figure}
This diff is collapsed.
Click to expand it.
tex/paper.tex
+
8
−
72
View file @
fafbac5d
...
@@ -72,78 +72,14 @@
...
@@ -72,78 +72,14 @@
\end{abstract}
\end{abstract}
\setcounter
{
tocdepth
}{
2
}
\tableofcontents\newpage
\setcounter
{
tocdepth
}{
2
}
\tableofcontents\newpage
\section
{
Introduction
}
\label
{
sec:intro
}
\section
{
Introduction
}
\label
{
sec:intro
}
\input
{
intro
}
\section
{
Applications
}
\label
{
sec:appl
}
\section
{
Preliminaries
}
\label
{
sec:prelim
}
\input
{
prelim
}
\subsection
{
Theory Classification
}
\label
{
sec:classifier
}
``Semantic Search'' -- a very suggestive term, which is alas seriously under-defined --
\section
{
Viewfinder
}
\label
{
sec:viewfinder
}
\input
{
viewfinder
}
has often been touted as the ``killer application'' of semantic technologies. With a view
finder, we can add another possible interpretation: searching mathematical ontologies
\section
{
Extended Use Case
}
\label
{
sec:usecase
}
\input
{
usecase
}
(here modular theorem prover libraries) at the level of theories -- we call this
\defemph
{
theory
classification
}
.
The basic use case is the following: Jane, a mathematician, becomes interested in a class
of mathematical objects, say -- as a didactic example -- something she initially calls
``beautiful subsets'' of a base set
$
\cB
$
(or just ``beautiful over
$
\cB
$
''). These have
the following properties:
\begin{compactenum}
\item
the empty set is beautiful over
$
\cB
$
\item
every subset of a beautiful set is beautiful over
$
\cB
$
\item
If
$
A
$
and
$
B
$
are beautiful over
$
\cB
$
and
$
A
$
has more elements than
$
B
$
, then
there is an
$
x
\in
A
\backslash
B
$
, such that
$
B
\cup\{
x
\}
$
is beautiful over
$
\cB
$
.
\end{compactenum}
To see what is known about beautiful sets, she types these three conditions into a theory
classifier, which interprets them as a
\MMT
theory
$
Q
$
, computes all (total) views from
$
Q
$
into a library
$
\cL
$
, and returns presentations of target theories and the assignments
made by the views. In our example we have the situation in
Figure~
\ref
{
fig:theory-classification-ex
}
\ednote
{
MK: Maybe better do this in jEdit and use
screenshots
}
\ednote
{
Interesting: the
$
\emptyset
$
clause could also be ``
$
\exists
S
$
beautiful'', which is equivalent via the subset clause, maybe use that in the example:
define Matroid with that and have a theorem that says that
$
\emptyset
$
is beautiful. Just
see what the viewfinder catches.
}
In the base use case, Jane learns that her
``beautiful sets'' correspond to the well-known structure of
matroids~
\cite
{
wikipedia:matroid
}
, so she can directly apply matroid theory to her
problems.
\begin{newpart}
{
MK: this could/should be extended
}
In extended use cases, we could
\begin{compactitem}
\item
use partial views to find theories that share significant structure with
$
Q
$
, so
that we can formalize
$
Q
$
with modularly with minimal effort. Say Jane was interested in
``dazzling subsets'', i.e. beautiful subsets that obey a fourth condition, then she
could just contribute a theory that extends
\textsf
{
matroid
}
by a formalization of the
fourth condition -- and maybe rethink the name.
\item
use existing views in
$
\cL
$
(compositions of views are vivews) to give Jane more
information about her beautiful subsets, e.g. that matroids (and thus beautiful sets)
form a generalization of the notion of linear independence from linear algebra.
\end{compactitem}
\end{newpart}
\begin{figure}
[ht]
\centering\lstset
{
aboveskip=0pt,belowskip=0pt
}
\begin{tabular}
{
|p
{
5cm
}
|p
{
5cm
}
|
}
\hline
$
Q
$
&
Result
\\\hline
\begin{lstlisting}
[mathescape]
theory query : F?MitM
include ?set
Base :
{
A
}
set A
beautiful
{
A
}
set A
$
\rightarrow
$
prop
empty :
$
\vdash
$
beautiful
$
\emptyset
$
subset-closed:
$
\vdash
$
{}
\end{lstlisting}
&
\begin{lstlisting}
[mathescape]
theory matroid : F?MitM
include ?baseset
independent
{
A
}
set A
$
\rightarrow
$
empty:
$
\vdash
$
hereditary :
$
\vdash
$
augmentation:
$
\vdash
$
\end{lstlisting}
\\\hline
\end{tabular}
\caption
{
Theory Classification for beautiful sets
}
\label
{
fig:theory-classification-ex
}
\end{figure}
\section
{
Conclusion
}
\label
{
sec:concl
}
\section
{
Conclusion
}
\label
{
sec:concl
}
...
...
This diff is collapsed.
Click to expand it.
tex/prelim.tex
0 → 100644
+
1
−
0
View file @
fafbac5d
MMT theories, flat, bla
\ No newline at end of file
This diff is collapsed.
Click to expand it.
tex/usecase.tex
0 → 100644
+
0
−
0
View file @
fafbac5d
This diff is collapsed.
Click to expand it.
tex/viewfinder.tex
0 → 100644
+
0
−
0
View file @
fafbac5d
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment