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

Fix reference naming

Browse Source
This commit is contained in:
Jip J. Dekker 2021-07-29 10:19:21 +10:00
parent 2efce9ef96
commit 47dcc6e3bf
No known key found for this signature in database
GPG Key ID: 517DF4A00618C9C3
2 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
assets/bibliography/references.bib
View File

@ -540,7 +540,7 @@
doi = {10.1016/j.artint.2012.04.001},
}
@inproceedings{gokberk-2020-ess-incr,
@inproceedings{kocak-2020-ess-incr,
author = {G{\"{o}}kberk Ko{\c{c}}ak and {\"{O}}zg{\"{u}}r Akg{\"{u}}n and
Nguyen Dang and Ian Miguel},
title = {Efficient Incremental Modelling and Solving},

2
chapters/2_background.tex
View File

@ -1101,7 +1101,7 @@ At its core, however, the \gls{rewriting} of \gls{ess-prime} works very differen
For each concept in the language the \compiler{} intrinsically knows how to rewrite it for its target \solver{}.
In particular, \glspl{decomp} for \constraints{} are not declared as predicates and functions in \gls{ess-prime}, but hard-coded in the compiler.
Recently, \textcite{gokberk-2020-ess-incr} have also presented Savile Row as the basis of a \gls{meta-optimization} toolchain.
Recently, \textcite{kocak-2020-ess-incr} have also presented Savile Row as the basis of a \gls{meta-optimization} toolchain.
The authors extend Savile Row to bridge the gap between the incremental assumption interface of \gls{sat} \solvers{} and the modelling language and show how this helps to efficiently solve pattern mining and optimization problems.
Consequently, the usage of \gls{meta-optimization} in Savile Row reiterates the use of \gls{meta-optimization} algorithms in \cmls{} in general and the need for incremental bridging between the modelling language and the \solver{}.