Principles and Practice of Constraint Programming — CP96: Second International Conference, CP96 Cambridge, MA, USA, August 19–22, 1996 Proceedings

Slim Abdennadher, Thom Frühwirth (auth.), Eugene C. Freuder (eds.)3540615512, 9783540615514

This book constitutes the refereed proceedings of the Second International Conference on Principles and Practice of Constraint Programming, CP ’96, held in Cambridge, MA, USA in August 1996.
The 36 revised full papers presented in the volume were selected from over 100 submissions; also included are abstracts of 22 selected poster presentations and 3 special lectures. CP is the flagship conference series on constraint processing with a number of satellite activities; thus the volume reflects the state of the art in the field.

---

Table of contents :
On confluence of Constraint Handling Rules….Pages 1-15
A labelling arc consistency method for functional constraints….Pages 16-30
Constraint satisfaction in optical routing for passive wavelength-routed networks….Pages 31-45
Using CSP look-back techniques to solve exceptionally hard SAT instances….Pages 46-60
MAC and combined heuristics: Two reasons to forsake FC (and CBJ?) on hard problems….Pages 61-75
The independence property of a class of set constraints….Pages 76-90
Speeding up constraint propagation by redundant modeling….Pages 91-103
A constraint-based interactive train rescheduling tool….Pages 104-118
Local search and the number of solutions….Pages 119-133
Derivation of constraints and database relations….Pages 134-148
Constraint programming: an efficient and practical approach to solving the job-shop problem….Pages 149-163
An instance of adaptive constraint propagation….Pages 164-178
An empirical study of dynamic variable ordering heuristics for the constraint satisfaction problem….Pages 179-193
Empirical studies of heuristic local search for constraint solving….Pages 194-208
Defeasibility in CLP( $$mathcal{Q}$$ ) through generalized slack variables….Pages 209-223
Inference duality as a basis for sensitivity analysis….Pages 224-236
Generalized local propagation: A framework for solving constraint hierarchies….Pages 237-251
Transformations between HCLP and PCSP….Pages 252-266
A test for tractability….Pages 267-281
Combination of constraint systems II: Rational amalgamation….Pages 282-296
Tractable disjunctions of linear constraints….Pages 297-307
Exploiting the use of DAC in MAX-CSP….Pages 308-322
A new approach for Weighted Constraint Satisfaction: Theoretical and computational results….Pages 323-337
Towards a more efficient stochastic constraint solver….Pages 338-352
A view of local search in constraint programming….Pages 353-366
From quasi-solutions to solution: An Evolutionary algorithm to solve CSP….Pages 367-381
Existential variables and local consistency in finite domain constraint problems….Pages 382-396
Logical semantics of concurrent constraint programming….Pages 397-409
Solving non-binary convex CSPs in continuous domains….Pages 410-424
An experimental comparison of three modified DeltaBlue algorithms….Pages 425-435
Constraint Logic Programming over unions of Constraint theories….Pages 436-450
Analysis of Hybrid systems in CLP( $$mathcal{R}$$ )….Pages 451-467
On query languages for linear queries definable with polynomial constraints….Pages 468-481
Analysis of heuristic methods for partial constraint satisfaction problems….Pages 482-496
Solving satisfiability problems using field programmable gate arrays: First results….Pages 497-509
A constraint program for solving the job-shop problem….Pages 510-524
PSAP — A planning system for aircraft production (extended abstract)….Pages 525-526
Using partial arc consistency in a database environment….Pages 527-528
Functional constraint hierarchies in CLP….Pages 529-530
Towards an open finite domain constraint solver….Pages 531-532
Efficient constraint propagation with good space complexity….Pages 533-534
Anytime temporal reasoning: Preliminary report (extended abstract)….Pages 535-536
From constraint minimization to goal optimization in CLP languages….Pages 537-538
Looking at full looking ahead….Pages 539-540
The arc and path consistency phase transitions….Pages 541-542
Experiences with combining constraint programming and discrete event simulation….Pages 543-544
Hill-climbing with local consistency for solving distributed CSPs….Pages 545-546
Approximate algorithms for maximum utility problems….Pages 547-548
A meta constraint logic programming architecture (extended abstract)….Pages 549-550
N-ary consistencies and constraint-based backtracking….Pages 551-552
Global behaviour for complex constraints….Pages 553-554
To guess or to think? Hybrid algorithms for SAT (extended abstract)….Pages 555-556
A local simplification scheme for cc programs….Pages 557-558
From evaluating upper bounds of the complexity of solving CSPs to finding all the solutions of CSPs….Pages 559-560
Modeling and solving distributed constraint satisfaction problems (DCSPs)….Pages 561-562
Scheduling an Asynchronously Shared Resource….Pages 563-564
The Generalized Railroad Crossing: Its symbolic analysis in CLP ( $$mathcal{R}$$ )….Pages 565-567
A stochastic approach to solving fuzzy constraint satisfaction problems….Pages 568-569
Branch- and-price for solving integer programs with a huge number of variables: Methods and applications….Pages 570-570
Constraint Databases….Pages 571-571
Complexity-theoretic aspects of programming language design….Pages 572-572