Principles and Practice of Constraint Programming - CP 2003: 9th International Conference, CP 2003, Kinsale, Ireland, September 29 - October 3, 2003, ProceedingsFrancesca Rossi This volume contains the proceedings of the Ninth International Conference on Principles and Practice of Constraint Programming (CP 2003), held in Kinsale, Ireland, from September 29 to October 3, 2003. Detailed information about the CP 2003 conference can be found at the URL http://www.cs.ucc.ie/cp2003/ The CP conferences are held annually and provide an international forum for the latest results on all aspects of constraint programming. Previous CP conferences were held in Cassis (France) in 1995, in Cambridge (USA) in 1996, in Schloss Hagenberg (Austria) in 1997, in Pisa (Italy) in 1998, in Alexandria (USA) in 1999, in Singapore in 2000, in Paphos (Cyprus) in 2001, and in Ithaca (USA) in 2002. Like previous CP conferences, CP 2003 again showed the interdisciplinary nature of computing with constraints, and also its usefulness in many problem domains and applications. Constraint programming, with its solvers, languages, theoretical results, and applications, has become a widely recognized paradigm to model and solve successfully many real-life problems, and to reason about problems in many research areas. |
Contents
| 1 | |
| 37 | |
Constraint Patterns | 53 |
Full Papers | 81 |
Boosting Chaffs Performance by Incorporating CSP Heuristics | 96 |
A TwoStage Hybrid Algorithm for Pickup and Delivery Vehicle Routing | 123 |
Solving Finite Domain Constraint Hierarchies by Local Consistency | 138 |
A Constraint Programming Application to Staff Scheduling | 153 |
A Synthesis of Constraint Satisfaction and Constraint Solving | 525 |
Maintaining Longest Paths Incrementally | 540 |
Resolution and Constraint Satisfaction | 555 |
Generating High Quality Schedules | 570 |
Symmetry Breaking Using Stabilizers | 585 |
An Efficient Bounds Consistency Algorithm | 600 |
Solving Existentially Quantified Constraints | 615 |
Using Constraint Programming to Solve the Maximum Clique Problem | 634 |
ConstraintBased Optimization with the Minimax Decision Criterion | 168 |
An Algebraic Approach to Multisorted Constraints | 183 |
PolynomialTime Algorithms | 199 |
Box Constraint Collections for Adhoc Constraints | 214 |
Propagation Redundancy in Redundant Modelling | 229 |
Complexity and Multimorphisms | 244 |
Constraint Satisfaction Differential Problems | 259 |
A Wealth of SAT Distributions with Planted Assignments | 274 |
Redundant Modeling for the QuasiGroup Completion Problem | 288 |
Open Constraint Optimization | 303 |
Constraints for Breaking More Row and Column Symmetries | 318 |
Generic SBDD Using Computational Group Theory | 333 |
Using Stochastic Local Search to Solve Quantified Boolean Formulae | 348 |
Solving MaxSAT as Weighted CSP | 363 |
Constraint Reasoning over Strings | 377 |
Tractability by Approximating Constraint Languages | 392 |
A Hybrid Constraint Programming | 407 |
A ConstraintAided Conceptual Design Environment | 422 |
Fast Bound Consistency for the Global Cardinality Constraint | 437 |
Propagating NAry RigidBody Constraints | 452 |
Solving Still Life with Soft Constraints and Bucket Elimination | 466 |
Exploiting Multidirectionality | 480 |
LocalSearch Techniques for Propositional Logic Extended | 495 |
DiscrepancyBased Additive Bounding for the AllDifferent Constraint | 510 |
Greater Efficiency for Conditional Constraint Satisfaction | 649 |
Incremental Computation of ResourceEnvelopes | 664 |
Approximated Consistency for Knapsack Constraints | 679 |
CostBased Filtering for Shorter Path Constraints | 694 |
Bounded Backtracking for the Valued Constraint Satisfaction Problems | 709 |
Pruning while Sweeping over Task Intervals | 739 |
Improving Backtrack Search for Solving the TCSP | 754 |
Poster Papers | 784 |
Distributed Forward Checking | 801 |
A New Class of Binary CSPs for which ArcConsistency | 807 |
Using the Breakout Algorithm to Identify Hard | 822 |
Supertree Construction with Constraint Programming | 837 |
A Canonicity Test for Configuration | 853 |
A TwoLevel Search Strategy for Packing Unequal Circles | 868 |
Constraints over Ontologies | 878 |
An Open Library for INcomplete Combinatorial OPtimization | 909 |
Applying Interchangeability Techniques | 925 |
A SATBased Approach to Multiple Sequence Alignment | 940 |
Self Configuring Constraint Programming Systems | 969 |
New Global Soft Constraints Dedicated | 977 |
Comparison of Symmetry Breaking Methods | 990 |
Explanations for Global Constraints | 993 |
Other editions - View all
Principles and Practice of Constraint Programming - CP 2003: 9th ..., Volume 9 Francesca Rossi No preview available - 2003 |
Common terms and phrases
agents applied approach arc consistency Artificial Intelligence assignment atom backtracking Berlin Heidelberg 2003 binary binary constraints Boolean checks clauses closure column combinatorial complexity Computer Science configuration consider constraint language constraint network Constraint Programming constraint propagation constraint satisfaction problem corresponding cost CPLEX defined Definition denote edge efficient encoding est(t example finite domain formula function given global graph heuristic implementation instances instantiation integer interval iteration Lemma linear LNCS lower bound matrix metaheuristics method multiset node nogood NP-complete NP-hard operation optimal paper parameters path performance permutation PLcc polynomial Practice of Constraint Proc procedure Proof properties propositional pruning random relations relaxation represent Rossi SAT solvers satisfiability SBDD scheduling Section semidefinite programming sequence solution solving Springer-Verlag Berlin Heidelberg straint structure subproblems subset symmetry breaking T-tree techniques Theorem tractable tree tuple unit propagation WalkSAT