Add half-reification text
This commit is contained in:
parent
3c168f3e12
commit
a77444b5d2
@ -1,3 +1,12 @@
|
||||
@book{allen-1978-lisp,
|
||||
author = {Allen, John},
|
||||
title = {Anatomy of LISP},
|
||||
year = 1978,
|
||||
isbn = {007001115X},
|
||||
publisher = {McGraw-Hill, Inc.},
|
||||
address = {USA},
|
||||
}
|
||||
|
||||
@inproceedings{araya-2008-cse-numcsp,
|
||||
author = {Ignacio Araya and Bertrand Neveu and Gilles Trombettoni},
|
||||
editor = {Peter J. Stuckey},
|
||||
@ -34,6 +43,21 @@
|
||||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||||
}
|
||||
|
||||
@article{balas-1989-pctsp,
|
||||
author = {Egon Balas},
|
||||
title = {The prize collecting traveling salesman problem},
|
||||
journal = {Networks},
|
||||
volume = 19,
|
||||
number = 6,
|
||||
pages = {621--636},
|
||||
year = 1989,
|
||||
url = {https://doi.org/10.1002/net.3230190602},
|
||||
doi = {10.1002/net.3230190602},
|
||||
timestamp = {Sun, 28 May 2017 13:19:52 +0200},
|
||||
biburl = {https://dblp.org/rec/journals/networks/Balas89.bib},
|
||||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||||
}
|
||||
|
||||
@inproceedings{belin-2014-interactive,
|
||||
author = {Bruno Belin and Marc Christie and Charlotte Truchet},
|
||||
editor = {Helmut Simonis},
|
||||
@ -90,6 +114,24 @@
|
||||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||||
}
|
||||
|
||||
@inproceedings{brand-2006-propagation,
|
||||
author = {Sebastian Brand and Roland H. C. Yap},
|
||||
editor = {Sandro Etalle and Miroslaw Truszczynski},
|
||||
title = {Towards "Propagation = Logic + Control"},
|
||||
booktitle = {Logic Programming, 22nd International Conference, {ICLP}
|
||||
2006, Seattle, WA, USA, August 17-20, 2006, Proceedings},
|
||||
series = {Lecture Notes in Computer Science},
|
||||
volume = 4079,
|
||||
pages = {102--116},
|
||||
publisher = {Springer},
|
||||
year = 2006,
|
||||
url = {https://doi.org/10.1007/11799573_10},
|
||||
doi = {10.1007/11799573_10},
|
||||
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
|
||||
biburl = {https://dblp.org/rec/conf/iclp/BrandY06.bib},
|
||||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||||
}
|
||||
|
||||
@article{chiarandini-2012-gbac,
|
||||
author = {Marco Chiarandini and Luca Di Gaspero and Stefano Gualandi
|
||||
and Andrea Schaerf},
|
||||
@ -196,6 +238,43 @@
|
||||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||||
}
|
||||
|
||||
@inproceedings{frisch-2007-essence,
|
||||
author = {Alan M. Frisch and Matthew Grum and Christopher Jefferson
|
||||
and Bernadette Mart{\'{\i}}nez Hern{\'{a}}ndez and Ian Miguel},
|
||||
editor = {Manuela M. Veloso},
|
||||
title = {The Design of {ESSENCE:} {A} Constraint Language for
|
||||
Specifying Combinatorial Problems},
|
||||
booktitle = {{IJCAI} 2007, Proceedings of the 20th International Joint
|
||||
Conference on Artificial Intelligence, Hyderabad, India,
|
||||
January 6-12, 2007},
|
||||
pages = {80--87},
|
||||
year = 2007,
|
||||
url = {http://ijcai.org/Proceedings/07/Papers/011.pdf},
|
||||
timestamp = {Tue, 20 Aug 2019 16:17:11 +0200},
|
||||
biburl = {https://dblp.org/rec/conf/ijcai/FrischGJHM07.bib},
|
||||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||||
}
|
||||
|
||||
@inproceedings{frisch-2009-undefinedness,
|
||||
author = {Alan M. Frisch and Peter J. Stuckey},
|
||||
editor = {Ian P. Gent},
|
||||
title = {The Proper Treatment of Undefinedness in Constraint
|
||||
Languages},
|
||||
booktitle = {Principles and Practice of Constraint Programming - {CP}
|
||||
2009, 15th International Conference, {CP} 2009, Lisbon,
|
||||
Portugal, September 20-24, 2009, Proceedings},
|
||||
series = {Lecture Notes in Computer Science},
|
||||
volume = 5732,
|
||||
pages = {367--382},
|
||||
publisher = {Springer},
|
||||
year = 2009,
|
||||
url = {https://doi.org/10.1007/978-3-642-04244-7_30},
|
||||
doi = {10.1007/978-3-642-04244-7_30},
|
||||
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
|
||||
biburl = {https://dblp.org/rec/conf/cp/FrischS09.bib},
|
||||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||||
}
|
||||
|
||||
@misc{gecode-2021-gecode,
|
||||
author = {{Gecode Team}},
|
||||
title = {Gecode: A Generic Constraint Development Environment},
|
||||
@ -203,6 +282,13 @@
|
||||
url = {http://www.gecode.org}
|
||||
}
|
||||
|
||||
@misc{gurobi-2021-gurobi,
|
||||
author = "Gurobi Optimization, LLC",
|
||||
title = "Gurobi Optimizer Reference Manual",
|
||||
year = 2021,
|
||||
url = "http://www.gurobi.com"
|
||||
}
|
||||
|
||||
@inproceedings{hebrard-2005-diverse,
|
||||
author = {Emmanuel Hebrard and Brahim Hnich and Barry O'Sullivan and
|
||||
Toby Walsh},
|
||||
@ -251,6 +337,22 @@
|
||||
publisher = {Springer US}
|
||||
}
|
||||
|
||||
@article{jefferson-2010-connectives,
|
||||
author = {Christopher Jefferson and Neil C. A. Moore and Peter
|
||||
Nightingale and Karen E. Petrie},
|
||||
title = {Implementing logical connectives in constraint programming},
|
||||
journal = {Artif. Intell.},
|
||||
volume = 174,
|
||||
number = {16-17},
|
||||
pages = {1407--1429},
|
||||
year = 2010,
|
||||
url = {https://doi.org/10.1016/j.artint.2010.07.001},
|
||||
doi = {10.1016/j.artint.2010.07.001},
|
||||
timestamp = {Sat, 16 Sep 2017 12:06:14 +0200},
|
||||
biburl = {https://dblp.org/rec/journals/ai/JeffersonMNP10.bib},
|
||||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||||
}
|
||||
|
||||
@article{jones-2002-multi-objective,
|
||||
author = {Dylan F. Jones and S. Keyvan Mirrazavi and Mehrdad Tamiz},
|
||||
title = {Multi-objective meta-heuristics: An overview of the current
|
||||
@ -283,6 +385,23 @@
|
||||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||||
}
|
||||
|
||||
@article{lougee-heimer-2003-coin,
|
||||
author = {Robin Lougee{-}Heimer},
|
||||
title = {The Common Optimization INterface for Operations Research:
|
||||
Promoting open-source software in the operations research
|
||||
community},
|
||||
journal = {{IBM} J. Res. Dev.},
|
||||
volume = 47,
|
||||
number = 1,
|
||||
pages = {57--66},
|
||||
year = 2003,
|
||||
url = {https://doi.org/10.1147/rd.471.0057},
|
||||
doi = {10.1147/rd.471.0057},
|
||||
timestamp = {Fri, 13 Mar 2020 10:54:17 +0100},
|
||||
biburl = {https://dblp.org/rec/journals/ibmrd/Lougee-Heimer03.bib},
|
||||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||||
}
|
||||
|
||||
@inproceedings{marinov-2005-sat-optimisations,
|
||||
author = {Darko Marinov and Sarfraz Khurshid and Suhabe Bugrara and
|
||||
Lintao Zhang and Martin C. Rinard},
|
||||
@ -317,6 +436,24 @@
|
||||
programming},
|
||||
}
|
||||
|
||||
@article{marriott-2008-zinc,
|
||||
author = {Kim Marriott and Nicholas Nethercote and Reza Rafeh and
|
||||
Peter J. Stuckey and Maria Garcia de la Banda and Mark
|
||||
Wallace},
|
||||
title = {The Design of the Zinc Modelling Language},
|
||||
journal = {Constraints An Int. J.},
|
||||
volume = 13,
|
||||
number = 3,
|
||||
pages = {229--267},
|
||||
year = 2008,
|
||||
url = {https://doi.org/10.1007/s10601-008-9041-4},
|
||||
doi = {10.1007/s10601-008-9041-4},
|
||||
timestamp = {Fri, 13 Mar 2020 10:58:29 +0100},
|
||||
biburl =
|
||||
{https://dblp.org/rec/journals/constraints/MarriottNRSBW08.bib},
|
||||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||||
}
|
||||
|
||||
@inproceedings{mears-2014-option,
|
||||
author = {Christopher Mears and Andreas Schutt and Peter J. Stuckey
|
||||
and Guido Tack and Kim Marriott and Mark Wallace},
|
||||
@ -480,6 +617,44 @@
|
||||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||||
}
|
||||
|
||||
@inproceedings{schulte-2000-deep,
|
||||
author = {Christian Schulte},
|
||||
editor = {Enrico Pontelli and V{\'{\i}}tor Santos Costa},
|
||||
title = {Programming Deep Concurrent Constraint Combinators},
|
||||
booktitle = {Practical Aspects of Declarative Languages, Second
|
||||
International Workshop, {PADL} 2000, Boston, MA, USA, January
|
||||
2000, Proceedings},
|
||||
series = {Lecture Notes in Computer Science},
|
||||
volume = 1753,
|
||||
pages = {215--229},
|
||||
publisher = {Springer},
|
||||
year = 2000,
|
||||
url = {https://doi.org/10.1007/3-540-46584-7_15},
|
||||
doi = {10.1007/3-540-46584-7_15},
|
||||
timestamp = {Tue, 14 May 2019 10:00:42 +0200},
|
||||
biburl = {https://dblp.org/rec/conf/padl/Schulte00.bib},
|
||||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||||
}
|
||||
|
||||
@inproceedings{schulte-2005-views,
|
||||
author = {Christian Schulte and Guido Tack},
|
||||
editor = {Peter van Beek},
|
||||
title = {Views and Iterators for Generic Constraint Implementations},
|
||||
booktitle = {Principles and Practice of Constraint Programming - {CP}
|
||||
2005, 11th International Conference, {CP} 2005, Sitges, Spain,
|
||||
October 1-5, 2005, Proceedings},
|
||||
series = {Lecture Notes in Computer Science},
|
||||
volume = 3709,
|
||||
pages = {817--821},
|
||||
publisher = {Springer},
|
||||
year = 2005,
|
||||
url = {https://doi.org/10.1007/11564751_71},
|
||||
doi = {10.1007/11564751_71},
|
||||
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
|
||||
biburl = {https://dblp.org/rec/conf/cp/SchulteT05.bib},
|
||||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||||
}
|
||||
|
||||
@article{schulte-2008-propagation,
|
||||
author = {Christian Schulte and Peter J. Stuckey},
|
||||
title = {Efficient constraint propagation engines},
|
||||
@ -495,6 +670,26 @@
|
||||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||||
}
|
||||
|
||||
@inproceedings{schutt-2009-cumulative,
|
||||
author = {Andreas Schutt and Thibaut Feydy and Peter J. Stuckey and
|
||||
Mark Wallace},
|
||||
editor = {Ian P. Gent},
|
||||
title = {Why Cumulative Decomposition Is Not as Bad as It Sounds},
|
||||
booktitle = {Principles and Practice of Constraint Programming - {CP}
|
||||
2009, 15th International Conference, {CP} 2009, Lisbon,
|
||||
Portugal, September 20-24, 2009, Proceedings},
|
||||
series = {Lecture Notes in Computer Science},
|
||||
volume = 5732,
|
||||
pages = {746--761},
|
||||
publisher = {Springer},
|
||||
year = 2009,
|
||||
url = {https://doi.org/10.1007/978-3-642-04244-7_58},
|
||||
doi = {10.1007/978-3-642-04244-7_58},
|
||||
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
|
||||
biburl = {https://dblp.org/rec/conf/cp/SchuttFSW09.bib},
|
||||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||||
}
|
||||
|
||||
@inproceedings{shaw-1998-local-search,
|
||||
author = {Paul Shaw},
|
||||
editor = {Michael J. Maher and Jean{-}Francois Puget},
|
||||
@ -515,6 +710,17 @@
|
||||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||||
}
|
||||
|
||||
@phdthesis{rendl-2010-thesis,
|
||||
author = {Andrea Rendl},
|
||||
title = {Effective compilation of constraint models},
|
||||
school = {University of St Andrews, {UK}},
|
||||
year = {2010},
|
||||
url = {http://hdl.handle.net/10023/973},
|
||||
timestamp = {Thu, 25 Aug 2016 17:20:59 +0200},
|
||||
biburl = {https://dblp.org/rec/phd/ethos/Rendl10.bib},
|
||||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||||
}
|
||||
|
||||
@book{silvano-1990-knapsack,
|
||||
author = {Martello, Silvano and Toth, Paolo},
|
||||
title = {Knapsack Problems: Algorithms and Computer Implementations},
|
||||
@ -575,6 +781,17 @@
|
||||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||||
}
|
||||
|
||||
@book{van-hentenryck-1999-opl,
|
||||
title = {The OPL Optimization Programming Language},
|
||||
author = {Van Hentenryck, P. and Lustig, I. and Puget, J.F. and
|
||||
Michel, L.},
|
||||
isbn = 9780262720304,
|
||||
lccn = 98034698,
|
||||
series = {Computing in Musicology; 11},
|
||||
year = 1999,
|
||||
publisher = {MIT Press}
|
||||
}
|
||||
|
||||
@book{wallis-2011-combinatorics,
|
||||
title = {Introduction to Combinatorics},
|
||||
author = {Wallis, W.D. and George, J.},
|
||||
@ -601,3 +818,14 @@
|
||||
year = 1988,
|
||||
publisher = {Wiley}
|
||||
}
|
||||
|
||||
@techreport{gamrath-2020-scip,
|
||||
author = {Gerald Gamrath and Daniel Anderson and Ksenia Bestuzheva and Wei-Kun Chen and Leon Eifler and Maxime Gasse and Patrick Gemander and Ambros Gleixner and Leona Gottwald and Katrin Halbig and Gregor Hendel and Christopher Hojny and Thorsten Koch and Le Bodic, Pierre and Stephen J. Maher and Frederic Matter and Matthias Miltenberger and Erik M{\"u}hmer and Benjamin M{\"u}ller and Marc E. Pfetsch and Franziska Schl{\"o}sser and Felipe Serrano and Yuji Shinano and Christine Tawfik and Stefan Vigerske and Fabian Wegscheider and Dieter Weninger and Jakob Witzig},
|
||||
title = {{The SCIP Optimization Suite 7.0}},
|
||||
type = {ZIB-Report},
|
||||
institution = {Zuse Institute Berlin},
|
||||
number = {20-10},
|
||||
month = {March},
|
||||
year = {2020},
|
||||
url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-78023}
|
||||
}
|
||||
|
@ -67,7 +67,7 @@ style=apa,
|
||||
|
||||
% Code formatting
|
||||
\usepackage[
|
||||
cachedir=build/listings,
|
||||
cachedir=listings,
|
||||
outputdir=build,
|
||||
]{minted}
|
||||
\usemintedstyle{borland}
|
||||
@ -97,3 +97,62 @@ outputdir=build,
|
||||
% Proof Tree
|
||||
\usepackage[nounderscore]{syntax}
|
||||
\usepackage{bussproofs}
|
||||
|
||||
% Half-reification math things
|
||||
|
||||
% \DeclareMathOperator{\rules}{\mathit{rules}}
|
||||
% \DeclareMathOperator{\lazy}{\mathit{lazy}}
|
||||
% \DeclareMathOperator{\events}{\mathit{events}}
|
||||
% \DeclareMathOperator{\domain}{\mathit{domain}}
|
||||
% \DeclareMathOperator{\bc}{\mathit{bc}}
|
||||
% \DeclareMathOperator{\lbc}{\mathit{lbc}}
|
||||
% \DeclareMathOperator{\ubc}{\mathit{ubc}}
|
||||
% \DeclareMathOperator{\dmc}{\mathit{dmc}}
|
||||
% \DeclareMathOperator{\fix}{\mathit{fix}}
|
||||
% \DeclareMathOperator{\event}{\mathit{event}}
|
||||
% \DeclareMathOperator{\minassign}{\mathit{minassign}}
|
||||
% \DeclareMathOperator{\assign}{\mathit{assign}}
|
||||
% \DeclareMathOperator{\rep}{\mathit{rep}}
|
||||
% \DeclareMathOperator{\cl}{\mathit{cl}}
|
||||
% \DeclareMathOperator{\UP}{\mathit{UP}}
|
||||
% \DeclareMathOperator{\up}{\mathit{up}}
|
||||
% \DeclareMathOperator{\DOM}{\mathit{DOM}}
|
||||
% \DeclareMathOperator{\false}{\mathit{false}}
|
||||
% \DeclareMathOperator{\true}{\mathit{true}}
|
||||
% \DeclareMathOperator{\lit}{\mathit{lit}}
|
||||
% \DeclareMathOperator{\setb}{\mathit{sb}}
|
||||
% \DeclareMathOperator{\bnd}{\mathit{bnd}}
|
||||
% \DeclareMathOperator{\dsb}{\mathit{dsb}}
|
||||
% \DeclareMathOperator{\vars}{\mathit{vars}}
|
||||
% \DeclareMathOperator{\ivars}{\mathit{input}}
|
||||
% \DeclareMathOperator{\ovars}{\mathit{output}}
|
||||
% %\DeclareMathOperator{\supp}{supp}
|
||||
% \DeclareMathOperator{\solns}{\mathit{solns}}
|
||||
% \DeclareMathOperator{\solv}{\mathit{solv}}
|
||||
% \DeclareMathOperator{\isolv}{\mathit{isolv}}
|
||||
% \DeclareMathOperator{\conv}{\mathit{conv}}
|
||||
% \DeclareMathOperator{\ran}{\mathit{ran}}
|
||||
% \DeclareMathOperator{\ite}{\mathit{ite}}
|
||||
% \DeclareMathOperator{\VAR}{\mathit{VAR}}
|
||||
|
||||
% \newcommand{\VV}{{\cal V}}
|
||||
% \newcommand{\PP}{{\cal P}}
|
||||
% \newcommand{\range}[2]{\left[\,#1\,..\,#2\,\right]}
|
||||
% \newcommand{\gfp}{\textup{gfp}}
|
||||
% \newcommand{\lfp}{\textup{lfp}}
|
||||
% \newcommand{\iter}{\mathit{iter}}
|
||||
|
||||
% \newcommand{\half}{\Rightarrow}
|
||||
% \newcommand{\full}{\Leftrightarrow}
|
||||
% \renewcommand{\half}{\rightarrow}
|
||||
% \renewcommand{\full}{\leftrightarrow}
|
||||
|
||||
% \newcommand{\cross}{\times}
|
||||
% \renewcommand{\cross}{\baucross}
|
||||
% \renewcommand{\cross}{\ding{54}}
|
||||
% \newcommand{\entails}{\models}
|
||||
% \newcommand{\bigsqcap}{\mathop{\lower.1ex\hbox{\Large$\sqcap$}}}
|
||||
|
||||
% \newcommand{\mdiv}{\texttt{div}}
|
||||
% \newcommand{\element}{\texttt{element}}
|
||||
% \newcommand{\alldiff}{\texttt{all\_different}}
|
||||
|
File diff suppressed because it is too large
Load Diff
@ -43,7 +43,7 @@ following publication:
|
||||
\include{chapters/2_background}
|
||||
\include{chapters/3_paradigms}
|
||||
\include{chapters/4_rewriting}
|
||||
\include{chapters/5_half_reif}
|
||||
% \include{chapters/5_half_reif}
|
||||
\include{chapters/6_incremental}
|
||||
|
||||
\backmatter{}
|
||||
|
Reference in New Issue
Block a user