Principles and Practice of Constraint Programming - CP 2004

Strategies for Global Optimization of Temporal Preferences.- ID Walk: A Candidate List Strategy with a Simple Diversification Device.- Understanding Random SAT: Beyond the Clauses-to-Variables Ratio.- Symbolic Decision Procedures for QBF.- Propagation Guided Large Neighborhood Search.- A Regular Language Membership Constraint for Finite Sequences of Variables.- Generating Robust Partial Order Schedules.- Full Dynamic Substitutability by SAT Encoding.- Improved Bound Computation in Presence of Several Clique Constraints.- Improved Algorithms for the Global Cardinality Constraint.- Impact-Based Search Strategies for Constraint Programming.- The Cardinality Matrix Constraint.- Controllability of Soft Temporal Constraint Problems.- Hybrid Set Domains to Strengthen Constraint Propagation and Reduce Symmetries.- Speeding Up Constraint Propagation.- Theoretical Foundations of CP-Based Lagrangian Relaxation.- A Constraint for Bin Packing.- Solving Non-clausal Formulas with DPLL Search.- A Hyper-arc Consistency Algorithm for the Soft Alldifferent Constraint.- Efficient Strategies for (Weighted) Maximum Satisfiability.- Short Papers.- Preprocessing Techniques for Distributed Constraint Optimization.- Variable Ordering Heuristics Show Promise.- The Tractability of Global Constraints.- Support Inference for Generic Filtering.- Strong Cost-Based Filtering for Lagrange Decomposition Applied to Network Design.- The Impact of AND/OR Search Spaces on Constraint Satisfaction and Counting.- A General Extension of Constraint Propagation for Constraint Optimization.- How Much Backtracking Does It Take to Color Random Graphs? Rigorous Results on Heavy Tails.- Solving the Crane Scheduling Problem Using Intelligent Search Schemes.- Algorithms for Quantified Constraint Satisfaction Problems.- Improving the Applicability of Adaptive Consistency: Preliminary Results.- On-Demand Bound Computation for Best-First Constraint Optimization.- A New Algorithm for Maintaining Arc Consistency After Constraint Retraction.- Computing the Frequency of Partial Orders.- On Tightness of Constraints.- Concurrent Dynamic Backtracking for Distributed CSPs.- Doctoral Papers.- Set Variables and Local Search.- N-Kings for Dynamic Systems.- Relation Variables in Qualitative Spatial Reasoning.- Synchronous, Asynchronous and Hybrid Algorithms for DisCSP.- Long-Term Learning for Algorithm Control.- Solution Extraction with the "Critical Path" in Graphplan-Based Optimal Temporal Planning.- Machine Learning for Portfolio Selection Using Structure at the Instance Level.- Local Search with Maximal Independent Sets.- A Dynamic Restart Strategy for Randomized BT Search.- A BDD-Based Approach to Interactive Configuration.- Extending Super-solutions.- Choosing Efficient Representations of Abstract Variables.- A Hypergraph Separator Based Variable Ordering Heuristic for Solving Real World SAT.- Exploiting Symmetries via Permutations for PC Board Manufacturing.- Iterative Forward Search Algorithm: Combining Local Search with Maintaining Arc Consistency and a Conflict-Based Statistics.- Programming Robotic Devices with a Timed Concurrent Constraint Language.- Heuristics for the Distributed Breakout Algorithm.- Explanations and Numeric CSPs.- Softly Constrained CP Nets.- Online Constraint Solving and Rectangle Packing.- Modelling Chemical Reactions Using Constraint Programming and Molecular Graphs.- Constraining Special-Purpose Domain Types.- Demonstrations.- PLASMA: A Constraint Based Planning Architecture.- Applying Constraint Satisfaction Techniques to 3D Camera Control.- Adaptive Enterprise Optimization Framework: AEO Server and AEO Studio.- CRE2: A CP Application for Reconfiguring a Power Distribution Network for Power Losses Reduction.- A Constraint-Based Planner Applied to Data Processing Domains.- CLab: A C++ Library for Fast Backtrack-Free Interactive Product Configuration.- A Constraint-Based System for Hiring and Managing Graduate Teaching Assistants.- A Web-Based Meeting Scheduling Solver With Privacy Guarantees, Without Trusted Servers.- A Constraint-Based Graphics Library for B-Prolog.