Front matter
1-15
On confluence of Constraint Handling Rules
Slim Abdennadher, Thom Frühwirth and Holger Meuss
16-30
A labelling arc consistency method for functional constraints
M. S. Affane and H. Bennaceur
31-45
Constraint satisfaction in optical routing for passive wavelength-routed networks
Dhritiman Banerjee and Jeremy Frank
46-60
Using CSP look-back techniques to solve exceptionally hard SAT instances
Roberto J. Bayardo and Robert Schrag
61-75
MAC and combined heuristics: Two reasons to forsake FC (and CBJ?) on hard problems
Christian Bessière and Jean-Charles Régin
76-90
The independence property of a class of set constraints
Witold Charatonik and Andreas Podelski
91-103
Speeding up constraint propagation by redundant modeling
B. M. W. Cheng, J. H. M. Lee and J. C. K. Wu
104-118
A constraint-based interactive train rescheduling tool
C. K. Chiu, C. M. Chou, J. H. M. Lee, H. F. Leung and Y. W. Leung
119-133
Local search and the number of solutions
David A. Clark, Jeremy Frank, Ian P. Gent, Ewan MacIntyre and Neven Tomov, et al.
134-148
Derivation of constraints and database relations
David Cohen, Marc Gyssens and Peter Jeavons
149-163
Constraint programming: an efficient and practical approach to solving the job-shop problem
Yves Colombani
164-178
An instance of adaptive constraint propagation
Hani El Sakkout, Mark G. Wallace and E. Barry Richards
179-193
An empirical study of dynamic variable ordering heuristics for the constraint satisfaction problem
Ian P. Gent, Ewan MacIntyre, Patrick Presser, Barbara M. Smith and Toby Walsh
194-208
Empirical studies of heuristic local search for constraint solving
Jin-Kao Hao and Raphaël Dorne
209-223
Defeasibility in CLP(
Q\mathcal{Q}) through generalized slack variables
Christian Holzbaur, Francisco Menezes and Pedro Barahona
224-236
Inference duality as a basis for sensitivity analysis
J. N. Hooker
237-251
Generalized local propagation: A framework for solving constraint hierarchies
Hiroshi Hosobe, Satoshi Matsuoka and Akinori Yonezawa
252-266
Transformations between HCLP and PCSP
Michael Jampel, Jean-Marie Jacquet, David Gilbert and Sebastian Hunt
267-281
A test for tractability
Peter Jeavons, David Cohen and Marc Gyssens
282-296
Combination of constraint systems II: Rational amalgamation
Stephan Kepser and Klaus U. Schulz
297-307
Tractable disjunctions of linear constraints
Manolis Koubarakis
308-322
Exploiting the use of DAC in MAX-CSP
Javier Larrosa and Pedro Meseguer
323-337
A new approach for Weighted Constraint Satisfaction: Theoretical and computational results
Hoong Chuin Lau
338-352
Towards a more efficient stochastic constraint solver
Jimmy H. M. Lee, Ho-fung Leung and Hon-wing Won
353-366
A view of local search in constraint programming
Gilles Pesant and Michel Gendreau
367-381
From quasi-solutions to solution: An Evolutionary algorithm to solve CSP
María Cristina Riff Rojas
382-396
Existential variables and local consistency in finite domain constraint problems
Francesca Rossi
397-409
Logical semantics of concurrent constraint programming
Paul Ruet
410-424
Solving non-binary convex CSPs in continuous domains
Djamila Sam-Haroud and Boi V. Faltings
425-435
An experimental comparison of three modified DeltaBlue algorithms
Tetsuya Suzuki, Nobuo Kakinuma and Takehiro Tokuda
436-450
Constraint Logic Programming over unions of Constraint theories
Cesare Tinelli and Mehdi Harandi
451-467
Analysis of Hybrid systems in CLP(
R\mathcal{R})
Luis Urbina
468-481
On query languages for linear queries definable with polynomial constraints
Luc Vandeurzen, Marc Gyssens and Dirk Van Gucht
482-496
Analysis of heuristic methods for partial constraint satisfaction problems
Richard J. Wallace
497-509
Solving satisfiability problems using field programmable gate arrays: First results
Makoto Yokoo, Takayuki Suyama and Hiroshi Sawada
510-524
A constraint program for solving the job-shop problem
Jianyang Zhou
525-526
PSAP — A planning system for aircraft production (extended abstract)
Patrick Albers and Jacques Bellone
527-528
Using partial arc consistency in a database environment
Steven A. Battle
529-530
Functional constraint hierarchies in CLP
Mouhssine Bouzoubaa
531-532
Towards an open finite domain constraint solver
Mats Carlsson, Björn Carlson and Greger Ottosson
533-534
Efficient constraint propagation with good space complexity
Assef Chmeiss and Philippe Jégou
535-536
Anytime temporal reasoning: Preliminary report (extended abstract)
Mukesh Dalal and Yong Feng
537-538
From constraint minimization to goal optimization in CLP languages
François Fages
539-540
Looking at full looking ahead
Daniel Frost and Rina Dechter
541-542
The arc and path consistency phase transitions
Stuart A. Grant and Barbara M. Smith
543-544
Experiences with combining constraint programming and discrete event simulation
Wim Hellinck
545-546
Hill-climbing with local consistency for solving distributed CSPs
Katsutoshi Hirayama
547-548
Approximate algorithms for maximum utility problems
F. J. Jüngen and W. Kowalczyk
549-550
A meta constraint logic programming architecture (extended abstract)
E. Lamma, P. Mello and M. Milano
551-552
N-ary consistencies and constraint-based backtracking
Pierre-Paul Mérel, Zineb Habbas, Francine Herrmann and Daniel Singer
553-554
Global behaviour for complex constraints
Stéphane N'Dong and Michel Van Caneghem
555-556
To guess or to think? Hybrid algorithms for SAT (extended abstract)
Irina Rish and Rina Dechter
557-558
A local simplification scheme for cc programs
Vincent Schächter
559-560
From evaluating upper bounds of the complexity of solving CSPs to finding all the solutions of CSPs
Gadi Solotorevsky
561-562
Modeling and solving distributed constraint satisfaction problems (DCSPs)
Gadi Solotorevsky, Ehud Gudes and Amnon Meisels
563-564
Scheduling an Asynchronously Shared Resource
Douglas R. Smith and Stephen J. Westfold
565-567
The Generalized Railroad Crossing: Its symbolic analysis in CLP (
R\mathcal{R})
Luis Urbina
568-569
A stochastic approach to solving fuzzy constraint satisfaction problems
Jason H. Y. Wong, Ka-fai Ng and Ho-fung Leung
570
Branch- and-price for solving integer programs with a huge number of variables: Methods and applications
George L. Nemhauser
571
Constraint Databases
Dina Q. Goldin
572
Complexity-theoretic aspects of programming language design
Harry G. Mairson
Back matter