Ebook: Principles and Practice of Constraint Programming-CP97: Third International Conference, CP97 Linz, Austria, October 29 – November 1, 1997 Proceedings

This book constitutes the refereed proceedings of the Third International Conference on Principles and Practice of Constraint Programming, CP'97, held in Linz, Austria in October/November 1997.
The volume presents 37 revised full papers carefully selected from a total of 132 submissions; also included are the abstracts of two invited talks and three tutorials. The papers address all current aspects of constraint programming. Among the topics covered are constraint matching, constraint languages, set constraints, constraint search, constraint satisfaction problems, scheduling, constraint routing, temporal constraints, constraint graphs, local search, object-oriented constraint programming, etc.

---

This book constitutes the refereed proceedings of the Third International Conference on Principles and Practice of Constraint Programming, CP'97, held in Linz, Austria in October/November 1997.
The volume presents 37 revised full papers carefully selected from a total of 132 submissions; also included are the abstracts of two invited talks and three tutorials. The papers address all current aspects of constraint programming. Among the topics covered are constraint matching, constraint languages, set constraints, constraint search, constraint satisfaction problems, scheduling, constraint routing, temporal constraints, constraint graphs, local search, object-oriented constraint programming, etc.

---

This book constitutes the refereed proceedings of the Third International Conference on Principles and Practice of Constraint Programming, CP'97, held in Linz, Austria in October/November 1997.
The volume presents 37 revised full papers carefully selected from a total of 132 submissions; also included are the abstracts of two invited talks and three tutorials. The papers address all current aspects of constraint programming. Among the topics covered are constraint matching, constraint languages, set constraints, constraint search, constraint satisfaction problems, scheduling, constraint routing, temporal constraints, constraint graphs, local search, object-oriented constraint programming, etc.
Content:
Front Matter....Pages -
Narrowing a 2n-block of sortings in O (n logn)....Pages 1-1
Solving various weighted matching problems with constraints....Pages 2-16
A filtering algorithm for global sequencing constraints....Pages 17-31
Semantics and expressive power of a timed concurrent constraint language....Pages 32-46
Solving classes of set constraints with tree automata....Pages 47-61
The logic of search algorithms: Theory and applications....Pages 62-76
Verification of parallel systems using constraint programming....Pages 77-91
Random constraint satisfaction: A more accurate picture....Pages 92-106
Heavy-tailed distributions in combinatorial search....Pages 107-120
Counting, structure identification and maximum consistency for binary constraint satisfaction problems....Pages 121-135
Statistical analysis of backtracking on inconsistent CSPs....Pages 136-149
Using constraint propagation for complex scheduling problems: Managing size, complex resources and travel....Pages 150-162
Understanding and improving the MAC algorithm....Pages 163-166
Modelling exceptionally hard constraint satisfaction problems....Pages 167-181
Tabu search for maximal constraint satisfaction problems....Pages 182-195
Reconfigurable architectures: A new vision for optimization problems....Pages 196-208
Distributed partial constraint satisfaction problem....Pages 209-221
Operational semantics and confluence of constraint propagation rules....Pages 222-236
AC-unification of higher-order patterns....Pages 237-251
On the complexity of unification and disunification in commutative idempotent semigroups....Pages 252-266
Ordering constraints over feature trees....Pages 267-281
From restricted path consistency to max-restricted path consistency....Pages 282-296
The constrainedness of Arc consistency....Pages 297-311
Look-ahead versus look-back for satisfiability problems....Pages 312-326
Why adding more constraints makes a problem easier for hill-climbing algorithms: Analyzing landscapes of CSPs....Pages 327-340
Interval methods for non-linear constraints....Pages 341-355
Configurable solvers: Tailoring general methods to specific applications....Pages 356-370
Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems....Pages 371-371
Five pitfalls of empirical scheduling research....Pages 372-374
Bounding the optimum of constraint optimization problems....Pages 375-389
GENIUS-CP: A generic single-vehicle routing algorithm....Pages 390-404
Satisfiability of quantitative temporal constraints with multiple granularities....Pages 405-419
Tractable recursion over geometric data....Pages 420-434
Finding solvable subsets of constraint graphs....Pages 435-449
Tractable disjunctive constraints....Pages 450-462
Compiling constraint solving using projection....Pages 463-477
Oscillation, heuristic ordering and pruning in neighborhood search....Pages 478-490
Programming constraint inference engines....Pages 491-505
NeMo+: Object-oriented constraint programming environment based on subdefinite models....Pages 506-518
Set constraints: A pearl in research on constraints....Pages 519-533
Back Matter....Pages 534-548
....Pages 549-561