optimize.bbl
\begin{thebibliography}{}

\bibitem[\protect\citeauthoryear{Abdennadher and Rigotti}{Abdennadher and
  Rigotti}{2002}]{slim}
{\sc Abdennadher, S.} {\sc and} {\sc Rigotti, C.} 2002.
\newblock Automatic generation of rule-based solvers for intentionally defined
  constraints.
\newblock {\em IJAIT\/}~{\em 11,\/}~2, 283--302.

\bibitem[\protect\citeauthoryear{Apt}{Apt}{2003}]{apt-book}
{\sc Apt, K.} 2003.
\newblock {\em Principles of Constraint Programming}.
\newblock Cambridge University Press.

\bibitem[\protect\citeauthoryear{Apt and Monfroy}{Apt and Monfroy}{2001}]{apt}
{\sc Apt, K.} {\sc and} {\sc Monfroy, E.} 2001.
\newblock Constraint programming viewed as rule-based programming.
\newblock {\em Theory and Practice of Logic Programming\/}~{\em 1,\/}~6,
  713--750.

\bibitem[\protect\citeauthoryear{Azevedo and Barahona}{Azevedo and
  Barahona}{2000}]{card}
{\sc Azevedo, F.} {\sc and} {\sc Barahona, P.} 2000.
\newblock Modelling digital circuits problems with set constraints.
\newblock In {\em Proceedings of the 1st International Conference on
  Computational Logic}. 414--428.

\bibitem[\protect\citeauthoryear{Brand}{Brand}{2003}]{brand}
{\sc Brand, S.} 2003.
\newblock A note on redundant rules in rule-based constraint programming.
\newblock In {\em Recent Advances in Constraints}. 109 -- 120.

\bibitem[\protect\citeauthoryear{Cheadle, Harvey, Sadler, Schimpf, Shen, and
  Wallace}{Cheadle et~al\mbox{.}}{2003}]{eclipse-intro}
{\sc Cheadle, A.~M.}, {\sc Harvey, W.}, {\sc Sadler, A.~J.}, {\sc Schimpf, J.},
  {\sc Shen, K.}, {\sc and} {\sc Wallace, M.~G.} 2003.
\newblock {\eclipse}: An introduction.
\newblock Technical Report IC-Parc-03-1, {IC-Parc}, Imperial College London.

\bibitem[\protect\citeauthoryear{Cheng, Choi, Lee, and Wu}{Cheng
  et~al\mbox{.}}{1999}]{redundant-modelling}
{\sc Cheng, B. M.~W.}, {\sc Choi, K. M.~F.}, {\sc Lee, J. H.~M.}, {\sc and}
  {\sc Wu, J. C.~K.} 1999.
\newblock Increasing constraint propagation by redundant modeling: an
  experience report.
\newblock {\em Constraints\/}~{\em 4,\/}~2, 167--192.

\bibitem[\protect\citeauthoryear{Choi and Lee}{Choi and Lee}{2002}]{choi+lee}
{\sc Choi, C.~W.} {\sc and} {\sc Lee, J. H.~M.} 2002.
\newblock On the pruning behaviour of minimal combined models for permutation
  {CSPs}.
\newblock In {\em Proceedings of the International Workshop on Reformulating
  Constraint Satisfaction Problems}. 3--17.

\bibitem[\protect\citeauthoryear{Choi, Lee, and Stuckey}{Choi
  et~al\mbox{.}}{2003a}]{redundant}
{\sc Choi, C.~W.}, {\sc Lee, J. H.~M.}, {\sc and} {\sc Stuckey, P.~J.} 2003a.
\newblock Propagation redundancy for permutation channels.
\newblock In {\em IJCAI-03}. 1370--1371.

\bibitem[\protect\citeauthoryear{Choi, Lee, and Stuckey}{Choi
  et~al\mbox{.}}{2003b}]{redundant-cp03}
{\sc Choi, C.~W.}, {\sc Lee, J. H.~M.}, {\sc and} {\sc Stuckey, P.~J.} 2003b.
\newblock Propagation redundancy in redundant modelling.
\newblock In {\em CP 2003}.
\newblock 229--243.

\bibitem[\protect\citeauthoryear{Freuder}{Freuder}{1982}]{backtrack-free}
{\sc Freuder, E.~C.} 1982.
\newblock A sufficient condition for backtrack-free search.
\newblock {\em Journal of the ACM\/}~{\em 29,\/}~1, 24--32.

\bibitem[\protect\citeauthoryear{Geelen}{Geelen}{1992}]{geelen92dual}
{\sc Geelen, P.~A.} 1992.
\newblock Dual viewpoint heuristics for binary constraint satisfaction
  problems.
\newblock In {\em Proceedings of the 10th European Conference on Artificial
  Intelligence}. 31--35.

\bibitem[\protect\citeauthoryear{Gervet}{Gervet}{1997}]{conjunto}
{\sc Gervet, C.} 1997.
\newblock Interval propagation to reason about sets: Definition and
  implementation of a practical language.
\newblock {\em Constraints\/}~{\em 1,\/}~3, 191--244.

\bibitem[\protect\citeauthoryear{Hnich, Kiziltan, and Walsh}{Hnich
  et~al\mbox{.}}{2002}]{hnich02modelling}
{\sc Hnich, B.}, {\sc Kiziltan, Z.}, {\sc and} {\sc Walsh, T.} 2002.
\newblock Modelling a balanced academic curriculum problem.
\newblock In {\em Proceedings of the 4th International Workshop on Integration
  of AI and OR Techniques in Constraint Programming for Combinatorial
  Optimisation Problems (CP-AI-OR'02)}. 121--131.

\bibitem[\protect\citeauthoryear{Hnich, Walsh, and Smith}{Hnich
  et~al\mbox{.}}{2004}]{hnich-jair04}
{\sc Hnich, B.}, {\sc Walsh, T.}, {\sc and} {\sc Smith, B.~M.} 2004.
\newblock Dual modelling of permutation and injection problems.
\newblock {\em JAIR\/}~{\em 21}, 357--391.

\bibitem[\protect\citeauthoryear{{ILOG Solver}}{{ILOG Solver}}{1999}]{ilog}
{\sc {ILOG Solver}}. 1999.
\newblock {\em {ILOG Solver} 4.4: Reference Manual}.

\bibitem[\protect\citeauthoryear{Mackworth}{Mackworth}{1977}]{mackworth}
{\sc Mackworth, A.~K.} 1977.
\newblock Consistency in networks of relations.
\newblock {\em AI Journal\/}~{\em 8,\/}~1, 99--118.

\bibitem[\protect\citeauthoryear{Marriott and Stuckey}{Marriott and
  Stuckey}{1998}]{book}
{\sc Marriott, K.} {\sc and} {\sc Stuckey, P.~J.} 1998.
\newblock {\em Programming with Constraints: an Introduction}.
\newblock The MIT Press.

\bibitem[\protect\citeauthoryear{Mohr and Masini}{Mohr and Masini}{1998}]{gac4}
{\sc Mohr, R.} {\sc and} {\sc Masini, G.} 1998.
\newblock Good old discrete relaxation.
\newblock In {\em ECAI-88}. 651--656.

\bibitem[\protect\citeauthoryear{M{\"u}ller}{M{\"u}ller}{2001}]{muller}
{\sc M{\"u}ller, T.} 2001.
\newblock Constraint propagation in mozart.
\newblock Ph.D. thesis, Universit{\"a}t des Saarlandes,
  Naturwissenschaftlich-Technische Fakult{\"a}t I, Fachrichtung Informatik.

\bibitem[\protect\citeauthoryear{Puget and R{\'e}gin}{Puget and
  R{\'e}gin}{2001}]{allinterval}
{\sc Puget, J.-F.} {\sc and} {\sc R{\'e}gin, J.-C.} 2001.
\newblock Solving the all interval problem.
\newblock Available at \texttt{http://www.csplib.org/prob/prob007/puget.pdf}.

\bibitem[\protect\citeauthoryear{R{\'e}gin}{R{\'e}gin}{1994}]{Regin94}
{\sc R{\'e}gin, J.-C.} 1994.
\newblock A filtering algorithm for constraints of difference in {CSP}s.
\newblock In {\em AAAI-94}. Vol.~1. 362--367.

\bibitem[\protect\citeauthoryear{{SICStus Prolog}}{{SICStus
  Prolog}}{2003}]{sics}
{\sc {SICStus Prolog}}. 2003.
\newblock {\em {SICStus Prolog User's Manual, Release 3.10.1}}.

\bibitem[\protect\citeauthoryear{Smith}{Smith}{2000}]{smith00modelling}
{\sc Smith, B.~M.} 2000.
\newblock Modelling a permutation problem.
\newblock Research Report 2000.18, School of Computer Studies, University of
  Leeds.

\bibitem[\protect\citeauthoryear{Smith}{Smith}{2001}]{smith01dual}
{\sc Smith, B.~M.} 2001.
\newblock Dual models in constraint programming.
\newblock Research Report 2001.02, School of Computer Studies, University of
  Leeds.

\bibitem[\protect\citeauthoryear{{Van Hentenryck}, Saraswat, and Deville}{{Van
  Hentenryck} et~al\mbox{.}}{1998}]{pdv2}
{\sc {Van Hentenryck}, P.}, {\sc Saraswat, V.}, {\sc and} {\sc Deville, Y.}
  1998.
\newblock Design, implementation and evaluation of the constraint language
  cc({FD}).
\newblock {\em JLP\/}~{\em 37,\/}~1--3, 139--164.

\bibitem[\protect\citeauthoryear{Walsh}{Walsh}{2001}]{toby}
{\sc Walsh, T.} 2001.
\newblock Permutation problems and channelling constraints.
\newblock In {\em LPAR 2001}. 377--391.

\bibitem[\protect\citeauthoryear{Walsh}{Walsh}{2003}]{multiset-cp03}
{\sc Walsh, T.} 2003.
\newblock Consistency and propagation with multiset constraints: A formal
  viewpoint.
\newblock In {\em CP 2003}.
\newblock 724--738.

\end{thebibliography}
