fopraref.bib

@INPROCEEDINGS{DBLP:conf/cp/ReginG04,
  AUTHOR = {Jean-Charles R{\'e}gin and Carla P. Gomes},
  TITLE = {The Cardinality Matrix Constraint.},
  BOOKTITLE = {CP},
  YEAR = {2004},
  PAGES = {572-587},
  BIBSOURCE = {DBLP, http://dblp.uni-trier.de},
  EE = {http://springerlink.metapress.com/openurl.asp?genre=article{\&}issn=0302-9743{\&}volume=3258{\&}spage=572},
  OWNER = {Venator},
  TIMESTAMP = {2006.01.17}
}

@INPROCEEDINGS{DBLP:conf/cp/ReginP97,
  AUTHOR = {Jean-Charles R{\'e}gin and Jean-Francois Puget},
  TITLE = {A Filtering Algorithm for Global Sequencing Constraints.},
  BOOKTITLE = {CP},
  YEAR = {1997},
  PAGES = {32-46},
  BIBSOURCE = {DBLP, http://dblp.uni-trier.de},
  OWNER = {Venator},
  TIMESTAMP = {2006.01.17}
}

@BOOK{AhoAl1974,
  TITLE = {The Design and Analysis of Computer Algorithms},
  PUBLISHER = {Addison-Wesley},
  YEAR = {1974},
  AUTHOR = {Aho, Alfred V. and Hopcroft, John E. and Ullman, Jeffrey D.},
  VOLUME = {-},
  SERIES = {Addison-Wesley Series in Computer Science and Information Processing},
  ADDRESS = {Reading,Massachusetts - Menlo Park,California - London}
}

@TECHREPORT{radix,
  AUTHOR = {Arne Andersson and Torben Hagerup and Stefan Nilsson and Rajeev Raman},
  TITLE = {Sorting in Linear Time},
  INSTITUTION = {Schweden and MPI SB},
  YEAR = {1995},
  ADDRESS = {Nevada}
}

@BOOK{apt03principles,
  TITLE = {Principles of Constraint Programming},
  PUBLISHER = {Cambridge University Press},
  YEAR = {2003},
  AUTHOR = {K. Apt},
  URL = {http://citeseer.ist.psu.edu/apt03principles.html}
}

@INPROCEEDINGS{AptRough,
  AUTHOR = {Krzysztof R. Apt},
  TITLE = {The Rough Guide to Constraint Propagation},
  BOOKTITLE = {CP '99: Proceedings of the 5th International Conference on Principles
	and Practice of Constraint Programming},
  YEAR = {1999},
  PAGES = {1--23},
  PUBLISHER = {Springer-Verlag},
  ISBN = {3-540-66626-5}
}

@INPROCEEDINGS{aptessence,
  AUTHOR = {Krzysztof R. Apt},
  TITLE = {The Essence of Constraint Propagation},
  YEAR = {1998},
  VOLUME = {cs.AI/9811024},
  JOURNAL = {CoRR},
  ONLINESOURCE = {http://arxiv.org/abs/cs.AI/9811024}
}

@BOOK{cbsched,
  TITLE = {Constraint-Based Scheduling},
  PUBLISHER = {Kluwer Academic Publishers},
  YEAR = {2001},
  AUTHOR = {Philippe Baptiste and Claude Le Pape and Wim Nuijten}
}

@INPROCEEDINGS{holygrail,
  AUTHOR = {Bart{\'a}k, Roman},
  TITLE = {Constraint Programming: In Pursuit of the Holy Grail},
  BOOKTITLE = {In Proceedings of the Week of Doctoral Students (WDS99)},
  YEAR = {1999},
  VOLUME = {Part IV},
  NUMBER = {555-564},
  ADDRESS = {Prague},
  MONTH = {June},
  PUBLISHER = {MatFyzPress},
  HOWPUBLISHED = {Available from \url{http://kti.ms.mff.cuni.cz/~bartak/constraints/index.html}},
  OWNER = {Venator},
  TIMESTAMP = {2006.02.12}
}

@BOOK{Berge1979,
  TITLE = {Graphs and hypergraphs},
  PUBLISHER = {North-Holland, Elsevier},
  YEAR = {1979},
  AUTHOR = {Berge, Claude},
  VOLUME = {6},
  SERIES = {North - Holland Mathematical Library},
  ADDRESS = {Amsterdam},
  EDITION = {Repr. of the 2., rev. ed. }
}

@ARTICLE{Colmerauer,
  AUTHOR = {No$\ddot{e}$lle Bleuzen-Guernalec and Alain Colmerauer},
  TITLE = {Optimal Narrowing of a Block of Sortings in Optimal Time},
  JOURNAL = {Constraints: An International Journal},
  YEAR = {2000},
  VOLUME = {5},
  PAGES = {85-118m},
  NUMBER = {1/2},
  MONTH = {January}
}

@BOOK{Corme2001,
  TITLE = {Introduction to Algorithms, second edition},
  PUBLISHER = {MIT Press},
  YEAR = {2001},
  AUTHOR = {Cormen, Thomas H. and Leierson, Charles E. and Rivest, 
	
	 Ronald L.},
  ADDRESS = {Cambridge, Massachusetts - London, England}
}

@LECTURE{introgreedy,
  AUTHOR = {Thomas Emden-Weinert and Stefan Hougardy and Bernd Kreuter and Hans
	J\"urgen Pr\"omel and Angelika Steger},
  INSTITUTION = {Humboldt-Universit\"at Berlin},
  TITLE = {Einf\"uhrung in {G}raphen und {A}lgorithmen},
  YEAR = {1996},
  LECTURENO = {-},
  COURSE = {Graphen und Algorithmen},
  OWNER = {Venator},
  TIMESTAMP = {2006.01.03},
  URL = {http://www.informatik.hu-berlin.de/Forschung_Lehre/algorithmen/lehre/skripte/ga/}
}

@BOOK{npcomplguide,
  TITLE = {Computers and Intractability: A Guide to the Theory of NP-Completeness},
  PUBLISHER = {W. H. Freeman \& Co.},
  YEAR = {1979},
  AUTHOR = {Michael R. Garey and David S. Johnson}
}

@INPROCEEDINGS{GMS:AllInterval,
  AUTHOR = {I.P. Gent and I. McDonald and B.M. Smith},
  TITLE = {Conditional Symmetry in the All-Interval Series Problem},
  BOOKTITLE = {Proceedings of the Third International Workshop on Symmetry in Constraint
	Satisfaction Problems},
  YEAR = {2003},
  EDITOR = {B.M. Smith and I.P. Gent and W. Harvey},
  PAGES = {55-65},
  URL = {http://www.dcs.st-and.ac.uk/~apes/papers/gmsSymCon03.pdf}
}

@TECHREPORT{csplib,
  AUTHOR = {I.P. Gent and T. Walsh},
  TITLE = {CSPLib: a benchmark library for constraints},
  INSTITUTION = {Technical report APES-09-1999},
  YEAR = {1999},
  NOTE = {Available from http://csplib.cs.strath.ac.uk/. A shorter version
	appears in the Proceedings of the 5th International Conference on
	Principles and Practices of Constraint Programming (CP-99).}
}

@ARTICLE{glover,
  AUTHOR = {Fred Glover},
  TITLE = {Maximum matching in a convex bipartite graph},
  JOURNAL = {Naval Research Logistics Quarterly},
  YEAR = {1967},
  VOLUME = {14},
  PAGES = {313-316},
  NUMBER = {3},
  MONTH = {September},
  OWNER = {Venator}
}

@INPROCEEDINGS{oc_ecsp:hentenryck99:opl:inp,
  AUTHOR = {Pascal Van Hentenryck and Laurent Michel and Laurent Perron and Jean-Charles
	R{\'e}gin},
  TITLE = {Constraint Programming in OPL},
  BOOKTITLE = {Proceedings of the International Conference on Principles and 
	
	 Practice of Declarative Programming (PPDP'99)},
  YEAR = {1999},
  EDITOR = {Gopalan Nadathur },
  VOLUME = {1702},
  SERIES = {Lecture Notes in Computer Science},
  PAGES = {98-116},
  MONTH = {September 29 - October 1},
  URL = {http://www.cs.brown.edu/people/pvh/ppdp99.ps}
}

@ARTICLE{Hopcroft73,
  AUTHOR = {John E. Hopcroft and Richard M. Karp},
  TITLE = {An $n^{5/2}$ algorithm for maximum matchings in bipartite graphs},
  JOURNAL = {SIAM: Journal of Computing},
  YEAR = {1973},
  VOLUME = {2},
  PAGES = {225--231},
  NUMBER = {4},
  MONTH = {December}
}

@BOOK{sicstus,
  TITLE = {SICStus Prolog user's manual, 3.11.1 Technical Report},
  PUBLISHER = {Swedish Institute of Computer Science},
  YEAR = {2004},
  AUTHOR = {I.S.Laboratory},
  URL = {http://www.sics.se/sicstus/docs/3.11.1/pdf/sicstus.pdf}
}

@INPROCEEDINGS{KT03:gcc,
  AUTHOR = {Katriel, Irit and Thiel, Sven},
  TITLE = {Fast Bound-Consistency for the Global Cardinality Constraint},
  BOOKTITLE = {Principles and Practice of Constraint Programming - CP 2003 : 
	
	9th International Conference, CP 2003},
  YEAR = {2003},
  EDITOR = {Rossi, Francesca},
  VOLUME = {2833},
  SERIES = {Lecture Notes in Computer Science},
  PAGES = {437--451},
  ADDRESS = {Kinsale, Ireland},
  PUBLISHER = {Springer},
  ISBN = {3-540-20202-1},
  PADDRESS = {Berlin, Germany}
}

@LECTURE{CP05no1,
  AUTHOR = {Kuhlmann, Marco and Tack, Guido},
  INSTITUTION = {Saarland University},
  TITLE = {Constraint Programming},
  YEAR = {2005},
  LECTURENO = {1},
  COURSE = {Constraint Programming},
  URL = {http://www.ps.uni-sb.de/courses/cp-ss05/}
}

@LECTURE{CP05no3,
  AUTHOR = {Kuhlmann, Marco and Tack, Guido},
  INSTITUTION = {Saarland University},
  TITLE = {Constraint Satisfaction Problems},
  YEAR = {2005},
  LECTURENO = {3},
  COURSE = {Constraint Programming},
  ABSTRACT = {Used a lot for the basic definitions of constraint programming.
	
	A perfect setup for those terminology issues.},
  PAGES = {1-3},
  URL = {http://www.ps.uni-sb.de/courses/cp-ss05/}
}

@LECTURE{CP05no4,
  AUTHOR = {Kuhlmann, Marco and Tack, Guido},
  INSTITUTION = {Saarland University},
  TITLE = {Propagators},
  YEAR = {2005},
  LECTURENO = {4},
  COURSE = {Constraint Programming},
  ABSTRACT = {Used a lot for the basic definitions of constraint programming.
	
	A perfect setup for those terminology issues.},
  URL = {http://www.ps.uni-sb.de/courses/cp-ss05/}
}

@INPROCEEDINGS{lopez-ortiz-fast,
  AUTHOR = {Alejandro L\'{o}pez-Ortiz and Claude-Guy Quimper 
	
	 and John Tromp and Peter van Beek},
  TITLE = {A Fast and Simple Algorithm for Bounds Consistency of 
	
	the Alldifferent Constraint},
  BOOKTITLE = {Proceedings of the 18th International Joint Conference 
	
	 on Artificial Intelligence},
  YEAR = {2003},
  PAGES = {245-250},
  ADDRESS = {Acapulco, Mexico},
  MONTH = {August},
  URL = {http://ai.uwaterloo.ca/~vanbeek/publications/ijcai03.pdf}
}

@TECHREPORT{lopez-ortiz-fastTR,
  AUTHOR = {Alejandro L\'{o}pez-Ortiz and Claude-Guy Quimper 
	
	and John Tromp and Peter van Beek},
  TITLE = {A Fast and Simple Algorithm for Bounds Consistency of 
	
	the Alldifferent Constraint, Technical Report},
  INSTITUTION = {School of Computer Science, University of Waterloo, Waterloo, Canada},
  YEAR = {2003},
  ADDRESS = {Acapulco, Mexico},
  URL = {http://ai.uwaterloo.ca/~vanbeek/publications/ijcai03_TR.ps}
}

@LECTURE{josko03,
  AUTHOR = {Leo Joskowicz, Associate Professor},
  INSTITUTION = {Saarland University},
  TITLE = {Linear-time sorting},
  YEAR = {2003},
  LECTURENO = {6},
  COURSE = {Data Structures 67109},
  URL = {http://www.cs.huji.ac.il/course/2003/dast/}
}

@MISC{mcaloon97sport,
  AUTHOR = {K. McAloon and C. Tretkoff and G. Wetzel},
  TITLE = {Sport League Scheduling},
  YEAR = {1997},
  TEXT = {K. McAloon, C. Tretkoff, and G. Wetzel. Sport League Scheduling. %
	
	 In Proceedings of the 3th Ilog International Users Meeting, Paris,%
	
	 France, 1997.},
  URL = {http://citeseer.ist.psu.edu/mcaloon97sports.html}
}

@BOOK{dsa-mehlhorn,
  TITLE = {Data Structures and Algorithms},
  PUBLISHER = {Springer Verlag},
  YEAR = {1984},
  AUTHOR = {Kurt Mehlhorn},
  VOLUME = {2 Graph Algorithms and NP-Completeness},
  SERIES = {EATCS Monographs}
}

@INPROCEEDINGS{Older95,
  AUTHOR = {W. J. Older and G. M. Swinkels and M. H. van Emden},
  TITLE = {Getting to the Real Problem: Experience with BNR Prolog in OR},
  BOOKTITLE = {Proc.of the Third International Conference on the Practical Application
	of Prolog},
  YEAR = {1995},
  PAGES = {465-478},
  ADDRESS = {Paris}
}

@INPROCEEDINGS{improvedgcc,
  AUTHOR = {Claude-Guy Quimper and Peter van Beek and Alejandro L\'{o}pez-Ortiz
	
	 and Alexander Golynski},
  TITLE = {{I}mproved {A}lgorithms for the {G}lobal {C}ardinality {C}onstraint},
  BOOKTITLE = {Proceedings of the 10th International Conference on Principles 
	
	 and Practice of Constraint Programming},
  YEAR = {2004},
  VOLUME = {3528},
  ADDRESS = {Toronto, Canada},
  MONTH = {September},
  URL = {http://ai.uwaterloo.ca/~vanbeek/publications/cp04b.pdf}
}

@INPROCEEDINGS{quimper-efficient,
  AUTHOR = {Claude-Guy Quimper and Peter van Beek and Alejandro L\'{o}pez-Ortiz
	
	 and Alexander Golynski and Sayyed Bashir Sadjad},
  TITLE = {An Efficient Bounds Consistency Algorithm for the 
	
	Global Cardinality Constraint},
  BOOKTITLE = {Proceedings of the 9th International Conference on Principles 
	
	 and Practice of Constraint Programming},
  YEAR = {2003},
  VOLUME = {2833},
  PAGES = {600--614},
  ADDRESS = {Kinsale, Ireland},
  MONTH = {September},
  URL = {http://ai.uwaterloo.ca/~vanbeek/publications/cp03.pdf}
}

@TECHREPORT{quimper-efficientTR,
  AUTHOR = {Claude-Guy Quimper and Peter van Beek and Alejandro L\'{o}pez-Ortiz
	
	 and Alexander Golynski and Sayyed Bashir Sadjad},
  TITLE = {An Efficient Bounds Consistency Algorithm for the 
	
	Global Cardinality Constraint, Technical Report},
  INSTITUTION = {School of Computer Science, University of Waterloo, Waterloo, Canada},
  YEAR = {2003},
  URL = {http://ai.uwaterloo.ca/~vanbeek/publications/gcc_TR.pdf}
}

@INPROCEEDINGS{cardamong,
  AUTHOR = {Jean-Charles R\'{e}gin},
  TITLE = {Combination of {A}mong and {C}ardinality {C}onstraints},
  BOOKTITLE = {Integration of AI and OR Techniques in Constraint Programming for
	Combinatorial Optimization Problems: Second International Conference,
	CPAIOR},
  YEAR = {2005},
  EDITOR = {Roman Bart\'{a}k and Michela Milano},
  VOLUME = {3524},
  SERIES = {Lecture Notes in Computer Science},
  PAGES = {288 - 303},
  ADDRESS = {Prague, Czech Republic},
  MONTH = {Jun},
  PUBLISHER = {Springer-Verlag},
  OWNER = {Venator},
  TIMESTAMP = {2006.01.14}
}

@INPROCEEDINGS{Regin96,
  AUTHOR = {R\'{e}gin, Jean-Charles},
  TITLE = {Generalized Arc Consistency for Global Cardinality
	
	 Constraint},
  BOOKTITLE = {Proceedings of the 13th National Conference on AI
	
	 (AAAI/IAAI'96)},
  YEAR = {1996},
  VOLUME = {1},
  PAGES = {209--215},
  ADDRESS = {Portland},
  MONTH = {August}
}

@INPROCEEDINGS{Regin94,
  AUTHOR = {R\'{e}gin, Jean-Charles},
  TITLE = {A filtering algorithm for constraints of difference in {CSP}s},
  BOOKTITLE = {Proceedings of 12th National Conference on AI (AAAI'94)},
  YEAR = {1994},
  VOLUME = {1},
  PAGES = {362--367},
  ADDRESS = {Seattle},
  MONTH = {July 31 - August 4}
}

@MANUAL{ilog,
  TITLE = {ILOG Solver 5.0:Reference Manual},
  AUTHOR = {ILOG S.A.},
  ORGANIZATION = {ILOG S.A.},
  YEAR = {2000},
  ADRESS = {Gentilly, France},
  EDITOR = {ILOG S.A.},
  PUBLISHER = {ILOG S.A.}
}

@MANUAL{gecref,
  TITLE = {Gecode 1.0.0 Reference Documentation},
  AUTHOR = {Christian Schulte},
  EDITION = {1.0.0},
  MONTH = {12},
  YEAR = {2006},
  OWNER = {Venator},
  TIMESTAMP = {2006.01.15}
}

@PHDTHESIS{Schulte:PHD:2000,
  AUTHOR = {Christian Schulte},
  TITLE = {Programming Constraint Services},
  SCHOOL = {Saarland University, Faculty for Natural Sciences I, Department of
	Computer Science},
  YEAR = {2000},
  TYPE = {Doctoral dissertation},
  ADDRESS = {Saarbr{\"u}cken, Germany},
  ABSTRACT = {This thesis presents design, application, implementation, and evaluation
	of computation spaces as abstractions for programming constraint
	services at a high level. Spaces are seamlessly integrated into
	a concurrent programming language and make constraint-based computations
	compatible with concurrency through encapsulation. Spaces are applied
	to search and combinators as essential constraint services. State-of-the-art
	and new search engines such as visual interactive search and parallel
	search are covered. Search is expressive and concurrency-compatible
	by using copying rather than trailing. Search is space and time
	efficient by using recomputation. Composable combinators, also known
	as deep-guard combinators, stress the control facilities and concurrency
	integration of spaces. The implementation of spaces comes as an
	orthogonal extension to the implementation of the underlying programming
	language. The resulting implementation is shown to be competitive
	with existing constraint programming systems.},
  LABEL = {ProgrammingConstraintServices},
  PROJECT-KEY = {C1},
  SLINE = {1081}
}

@MANUAL{fdcp,
  TITLE = {Finite Domain Constraint Programming in Oz. A Tutorial, 1.3.0 edition},
  AUTHOR = {Christian Schulte and Gert Smolka},
  YEAR = {2004},
  PDF = {http://www.mozart-oz.org/download/mozart-ftp/store/1.3.0-2004-04-15-print/tutorial/FiniteDomainProgramming.pdf.gz},
  URL = {http://www.mozart-oz.org/download/mozart-ftp/store/1.3.0-2004-04-15-print/tutorial/}
}

@INPROCEEDINGS{SchulteStuckey:CP:2004,
  AUTHOR = {Christian Schulte and Peter J. Stuckey},
  TITLE = {Speeding Up Constraint Propagation},
  BOOKTITLE = {Tenth International Conference on Principles and Practice of Constraint
	Programming},
  YEAR = {2004},
  EDITOR = {Mark Wallace},
  VOLUME = {3258},
  SERIES = {Lecture Notes in Computer Science},
  PAGES = {619--633},
  ADDRESS = {Toronto, Canada},
  MONTH = SEP,
  PUBLISHER = {Springer-Verlag},
  URL = {http://www.imit.kth.se/~schulte/paper.html?id=SchulteStuckey:CP:2004}
}

@INPROCEEDINGS{SchulteTack:CICLOPS:2005,
  AUTHOR = {Christian Schulte and Guido Tack},
  TITLE = {Views and Iterators for Generic Constraint Implementations},
  BOOKTITLE = {Proceedings of the Fifth International Colloqium on Implementation
	of Constraint and Logic Programming Systems},
  YEAR = {2005},
  EDITOR = {Christian Schulte and Fernando Silva and Ricardo Rocha},
  PAGES = {37--48},
  ADDRESS = {Sitges, Spain},
  MONTH = {Oct},
  NOTE = {To appear.},
  OWNER = {Venator},
  TIMESTAMP = {2006.01.16}
}

@ARTICLE{Shapira1997,
  AUTHOR = {Andrew Shapira},
  TITLE = {An Exact Performance Bound For An $O(m + n)$ Time Greedy Matching
	Procedure},
  JOURNAL = {The Electronic Journal of Combinatorics},
  YEAR = {1997},
  VOLUME = {4},
  CITESEERCITATIONCOUNT = {0},
  CITESEERURL = {http://citeseer.ist.psu.edu/144134.html},
  OWNER = {Venator},
  TIMESTAMP = {2006.01.05}
}

@PHDTHESIS{thiel2004,
  AUTHOR = {Sven Thiel},
  TITLE = {Efficient Algorithms for Constraint Propagation and for Processing
	Tree Descriptions},
  SCHOOL = {Saarland University, Faculty for Natural Sciences I, Department of
	Computer Science},
  YEAR = {2004},
  TYPE = {Doctoral dissertation},
  ADDRESS = {Saarbr{\"u}cken, Germany},
  MONTH = {May},
  PUBLISHER = {Saarland University},
  URL = {http://www.mpi-inf.mpg.de/~sthiel/thesis.pdf}
}

@BOOK{Haga,
  TITLE = {The Hagakure - A Code to the Way of the Samurai},
  YEAR = {1716},
  AUTHOR = {Yamamoto Tsunetomo}
}

@TECHREPORT{eclipse,
  AUTHOR = {Mark Wallace and Stefano Novello and Joachim Schimpf},
  TITLE = {Eclipse: A platform for constraint logic programming. Technical report},
  INSTITUTION = {IC-Parc, Imperial College, London, UK},
  YEAR = {1997},
  ADDRESS = {IC-Parc, Imperial College, London, UK},
  URL = {http://www.icparc.ic.ac.uk/eclipse/reports/eclipse/eclipse.html}
}

@INPROCEEDINGS{Zhou96,
  AUTHOR = {Jianyang Zhou},
  TITLE = {A Constraint Program for Solving the Job-Shop Problem},
  BOOKTITLE = {Principles and Practice of Constraint Programming},
  YEAR = {1996},
  PAGES = {510--524},
  URL = {http://citeseer.ist.psu.edu/zhou96constraint.html}
}

@ARTICLE{Zhou,
  AUTHOR = {Jianyang Zhou},
  TITLE = {A permutation-based-approach for solving the job-shop problem},
  JOURNAL = {Constraints: An International Journal},
  YEAR = {1973},
  VOLUME = {2},
  PAGES = {185--213},
  NUMBER = {2},
  MONTH = {October}
}

@MISC{MillerWebsite,
  AUTHOR = {{{John E. Miller}}},
  TITLE = {Langford's Problem},
  HOWPUBLISHED = {Available from \url{http://www.lclark.edu/~miller/langford.html}},
  YEAR = {20064},
  URL = {http://www.lclark.edu/~miller/langford.html}
}

@MISC{GecodeWebsite,
  AUTHOR = {{{The Gecode team}}},
  TITLE = {Generic constraint development environment},
  HOWPUBLISHED = {Available from \url{http://www.gecode.org}},
  YEAR = {2006},
  URL = {http://www.gecode.org}
}

@INPROCEEDINGS{smith00modelling,
  AUTHOR = {B. Smith},
  TITLE = {Modelling a Permutation Problem},
  BOOKTITLE = {Proceedings of ECAI'2000
    Workshop on Modelling and Solving Problems with Constraints},
  NOTE = {Also available as Research Report from http://www.comp.leeds.ac.uk/bms/papers.html},
  YEAR = {2000},
  URL = {citeseer.ist.psu.edu/smith00modelling.html}
}

@INPROCEEDINGS{PugetBnd,
  AUTHOR = {Jean-Francois Puget},
  TITLE = {A fast algorithm for the bound consistency of alldiff constraints},
  BOOKTITLE = {AAAI '98/IAAI '98: Proceedings of the fifteenth national/tenth conference on Artificial 
             intelligence/Innovative applications of artificial intelligence},
  YEAR = {1998},
  ISBN = {0-262-51098-7},
  PAGES = {359--366},
  LOCATION = {Madison, Wisconsin, United States},
  PUBLISHER = {American Association for Artificial Intelligence},
  ADDRESS = {Menlo Park, CA, USA}
}

@MISC{barnier02solving,
  AUTHOR = {N. Barnier and P. Brisset},
  TITLE = {Solving the Kirkman's schoolgirl problem in a few seconds},
  TEXT = {N. Barnier and P. Brisset. Solving the Kirkman's schoolgirl problem in
    a few seconds. In CP'2002.},
  YEAR = {2002},
  URL = {citeseer.ist.psu.edu/barnier02solving.html}
}

@INPROCEEDINGS{DBLP:conf/ecai/DincbasSH88,
  AUTHOR = {Mehmet Dincbas and
               Helmut Simonis and
               Pascal Van Hentenryck},
  TITLE = {Solving the Car-Sequencing Problem in Constraint Logic Programming.},
  BOOKTITLE = {ECAI},
  YEAR = {1988},
  PAGES = {290-295},
  BIBSOURCE = {DBLP, http://dblp.uni-trier.de}
}

@ARTICLE{benchgood,
  AUTHOR = {Mark Wallace and
               Joachim Schimpf and
               Kish Shen and
               Warwick Harvey},
  TITLE = {On Benchmarking Constraint Logic Programming Platforms.
               Response to Fernandez and Hill's "A Comparative Study of
               Eight Constraint Programming Languages over the Boolean
               and Finite Domains".},
  JOURNAL = {Constraints},
  VOLUME = {9},
  NUMBER = {1},
  YEAR = {2004},
  PAGES = {5-34},
  EE = {http://dx.doi.org/10.1023/B:CONS.0000006181.40558.37},
  BIBSOURCE = {DBLP, http://dblp.uni-trier.de}
}

@COMMENT{{jabref-entrytype: Lecture: req[author;institution;title;year;lectureno;course] opt[pdfdescrip;pdfsource]}}