Front matter
1
Visual Solver
A modeling language for constraint programming
Pascal Van Hentenryck
2-16
Narrowing a 2n-block of sortings in O (n logn)
Noëlle Bleuzen Guernalec and Alain Colmerauer
17-31
Solving various weighted matching problems with constraints
Yves Caseau and François Laburthe
32-46
A filtering algorithm for global sequencing constraints
Jean-Charles Régin and Jean-François Puget
47-61
Semantics and expressive power of a timed concurrent constraint language
Frank de Boer, M. Gabbrielli and M. C. Meo
62-76
Solving classes of set constraints with tree automata
P. Devienne, J M. Talbot and S. Tison
77-91
The logic of search algorithms: Theory and applications
Ian P. Gent and Judith L. Underwood
92-106
Verification of parallel systems using constraint programming
Stephan Melzer
107-120
Random constraint satisfaction: A more accurate picture
Dimitris Achlioptas, Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc and Michael S. O. Molloy, et al.
121-135
Heavy-tailed distributions in combinatorial search
Carla P. Gomes, Bart Selman and Nuno Crato
136-149
Counting, structure identification and maximum consistency for binary constraint satisfaction problems
Gabriel Istrate
150-162
Statistical analysis of backtracking on inconsistent CSPs
Irina Rish and Daniel Frost
163-166
Using constraint propagation for complex scheduling problems: Managing size, complex resources and travel
Yves Caseau
167-181
Understanding and improving the MAC algorithm
Daniel Sabin and Eugene C. Ereuder
182-195
Modelling exceptionally hard constraint satisfaction problems
Barbara M. Smith and Stuart A. Grant
196-208
Tabu search for maximal constraint satisfaction problems
Philippe Galinier and Jin-Kao Hao
209-221
Reconfigurable architectures: A new vision for optimization problems
Y. Hamadi and D. Merceron
222-236
Distributed partial constraint satisfaction problem
Katsutoshi Hirayama and Makoto Yokoo
237-251
Localizer
A modeling language for local search
Laurent Michel and Pascal Van Hentenryck
252-266
Operational semantics and confluence of constraint propagation rules
Slim Abdennadher
267-281
AC-unification of higher-order patterns
Alexandre Boudet and Evelyne Contejean
282-296
On the complexity of unification and disunification in commutative idempotent semigroups
Miki Hermann and Phokion G. Kolaitis
297-311
Ordering constraints over feature trees
Martin Müller, Joachim Niehren and Andreas Podelski
312-326
From restricted path consistency to max-restricted path consistency
Romuald Debruyne and Christian Bessière
327-340
The constrainedness of Arc consistency
Ian P. Gent, Ewan MacIntyre, Patrick Prosser, Paul Shaw and Toby Walsh
341-355
Look-ahead versus look-back for satisfiability problems
Chu Min Li and Anbulagan
356-370
Why adding more constraints makes a problem easier for hill-climbing algorithms: Analyzing landscapes of CSPs
Makoto Yokoo
371
Interval methods for non-linear constraints
Laurent Michel and Jean-Fançois Puget
372-374
Configurable solvers: Tailoring general methods to specific applications
Steven Minton
375-389
Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems
Philippe Baptiste and Claude Le Pape
390-404
Five pitfalls of empirical scheduling research
J. Christopher Beck, Andrew J. Davenport and Mark S. Fox
405-419
Bounding the optimum of constraint optimization problems
Simon de Givry, Gérard Verfaillie and Thomas Schiex
420-434
GENIUS-CP: A generic single-vehicle routing algorithm
Gilles Pesant, Michel Gendreaul and Jean-Marc Rousseau
435-449
Satisfiability of quantitative temporal constraints with multiple granularities
Claudio Bettinn, X. Sean Wang and Sushil Jajodia
450-462
Tractable recursion over geometric data
Extended Abstract
Stéphane Grumbachs and Gabriel Kuper
463-477
Finding solvable subsets of constraint graphs
Christoph M. Hoffmann, Andrew Lomonosov and Meera Sitharam
478-490
Tractable disjunctive constraints
David Cohen, Peter Jeavons and Manolis Koubarakis
491-505
Compiling constraint solving using projection
Warwick Harvey, Peter J. Stuckey and Alan Borning
506-518
Oscillation, heuristic ordering and pruning in neighborhood search
Jean-Marc Labat and Laurent Mynard
519-533
Programming constraint inference engines
Christian Schulte
534-548
NeMo+: Object-oriented constraint programming environment based on subdefinite models
Igor Shvetsov, Vitaly Telerman and Dmitry Ushakov
549-561
Set constraints: A pearl in research on constraints
Leszek Pacholski and Andreas Podelski
Back matter