Dekker1/dekker-phd-thesis
Archived
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Lose qualifier in the title

Browse Source
This commit is contained in:
Jip J. Dekker 2021-07-23 10:57:53 +10:00
parent f9e199d699
commit 4cf69764f7
No known key found for this signature in database
GPG Key ID: 517DF4A00618C9C3
6 changed files with 12 additions and 12 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
README.md
View File

@ -1,18 +1,18 @@
# A Modern Architecture for High-Level Constraint Modelling Languages
# A Modern Architecture for Constraint Modelling Languages
*Jip J. Dekker*
This is the repository containing Jip J. Dekker's PhD thesis: "A Modern Architecture for High-Level Constraint Modelling Languages"
This is the repository containing Jip J. Dekker's PhD thesis: "A Modern Architecture for Constraint Modelling Languages"
## Status Report
| Ch. | Title | State |
|-----|------------------------------------------|---------------------------------|
| | Abstract | 🆕 Blank |
| | Abstract | 📖 Ready for reading |
| 1 | Introduction | ⏳ Sent to Peter |
| 2 | Background | 🚧 Received feedback from Guido |
| 3 | Rewriting Constraint Modelling Languages | 📖 No planned work |
| 4 | Reasoning about Reification | ⏳ Sent to Guido |
| 4 | Reasoning about Reification | 🚧 Received feedback from Guido |
| 5 | Incremental Constraint Modelling | ⏳ Sent to Guido |
| 6 | Conclusions | ⏳ Sent to Julie |
| 6 | Conclusions | 🚧 Received feedback from Guido |
| A1 | MiniZinc Syntax | 📖 No planned work |
| A2 | Experiment Resources | 📖 Awaiting final changes |

4
chapters/3_rewriting_preamble.tex
View File

@ -4,7 +4,7 @@ We show how this tool chain allows us to:
\begin{itemize}
\item efficiently rewrite high-level \cmodels{} with \textbf{minimal overhead},
\item efficiently rewrite \cmodels{} with \textbf{minimal overhead},
\item easily integrate a range of \textbf{optimisation and simplification} techniques,
@ -18,4 +18,4 @@ This chapter is organised as follows.
\Cref{sec:rew-arch} provides an quick overview of the proposed architecture.
\Cref{sec:rew-micronano} introduces the core of our \gls{rewriting} system using the \microzinc{} and \nanozinc{} languages. These new languages provide a new intermediate representation that enables more efficient \gls{rewriting}.
\Cref{sec:rew-simplification} describes how we can perform various processing and simplification steps on this representation
Finally, in \cref{sec:rew-experiments} we report on the experimental results of the prototype implementation.
Finally, in \cref{sec:rew-experiments} we report on the experimental results of the prototype implementation.

2
chapters/6_conclusions.tex
View File

@ -17,7 +17,7 @@ These improvements focus on the performance of the \gls{rewriting} process in ge
This chapter presents the conclusions of this thesis.
We present a summary of the research and its contributions and discuss the future work arising from them.
\paragraph{Rewriting Architecture} In \cref{ch:rewriting}, we presented the principle contribution of this thesis: \textbf{an architectural design for the rewriting of a high-level \cml{}}.
\paragraph{Rewriting Architecture} In \cref{ch:rewriting}, we presented the principle contribution of this thesis: \textbf{an architectural design for the rewriting of a \cml{}}.
We introduced a transformation language \microzinc{}, a minimal describe to describe how an \instance{} is transformed into a \gls{slv-mod}.
At the core of this architecture lie formal rewriting rules for the \microzinc{} against which an implementation can be checked.
The transformation required for a complex \cml{}, such as \minizinc{}, can be reduced to \microzinc{} and as such enjoy the same guarantees.

2
chapters/A2_benchmark.tex
View File

@ -45,7 +45,7 @@ This repository contains the benchmarks for both \gls{gecode} and \gls{chuffed}.
\section{Software}%
\label{sec:bench-soft}
Central to the experiments in this thesis are two kinds of programs: programs that rewrite a high-level \constraint{} model into a \solver{} specification and the \solvers{} that given a specification search for solutions.
Central to the experiments in this thesis are two kinds of programs: programs that rewrite a \constraint{} model into a \solver{} specification and the \solvers{} that given a specification search for solutions.
We generally test the rewriting programs, in particular the \minizinc{} flattener, but use the \solvers{} to evaluate the effect of changes to these rewriting programs.
\subsection{MiniZinc Flattener}

2
dekker_preamble.tex
View File

@ -7,7 +7,7 @@ listof=totoc,
toc=bib,
]{scrreprt}
\title{Preamble of A Modern Architecture for High-Level Constraint Modelling Languages}
\title{Preamble of A Modern Architecture for Constraint Modelling Languages}
\author{Jip J. Dekker}
\input{assets/packages}

4
dekker_thesis.tex
View File

@ -7,7 +7,7 @@ listof=totoc,
toc=bib,
]{scrbook}
\title{A Modern Architecture for Functional Constraint Modelling Languages}
\title{A Modern Architecture for Constraint Modelling Languages}
\author{Jip J. Dekker}
\input{assets/packages}
@ -35,7 +35,7 @@ toc=bib,
{%
\usekomafont{title}{%
\Huge%
A Modern Architecture for High-Level Constraint Modelling Languages%
A Modern Architecture for \\Constraint Modelling Languages%
\par
}%
}