Principles and Practice of Constraint Programming - CP 2007: 13th International Conference, CP 2007, Providence, RI, USA, September 25-29, 2007, Proceedings

Front Cover
Christian Bessiere
Springer Science & Business Media, Oct 11, 2007 - Computers - 887 pages
0 Reviews
The 13th International Conference on Principles and Practice of Constraint Programming (CP 2007) was held in Providence, RI, USA, September 23–27, 2007, in conjunction with the International Conference on Automated Pl- ning and Scheduling (ICAPS). Held annually, the CP conference series is the premier international conference on constraint programming. The conference focuses on all aspects of computing with constraints. The CP conference - ries is organized by the Association for Constraint Programming (ACP). - formation about the conferences in the series can be found on the Web at http://www. cs. ualberta. ca/~ai/cp/. Information about ACP can be found athttp://www. a4cp. org/. CP 2007 launched two calls for contributions: a call for research papers, describing novel contributions in the ?eld, and a call for application papers, describing applications of constraint technology in the industrial world. The research track received 143 submissions and the application track received 22 submissions. Research papers were reviewed under a double-blind scheme. They received three reviews that the authors had the opportunity to see and to react tobeforethepapersandtheirreviewswerediscussedextensivelybythemembers of the ProgramCommittee. Application papers werereviewedby a separate- plication Committee. The Program Committee and the Application Committee then selected 43 researchpapers and 9 application papers to be published in full inthe proceedings,andanadditional14researchpapersto be publishedas short papers. The full papers were presented at the conference in two parallel tracks and the short papers were presented in a poster session.
 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

Caching in Backtracking Search
1
A Cautionary Tale
2
Estimation of the Minimal Duration of an Attitude Change for an Autonomous Agile EarthObserving Satellite
3
Solving an Air Conditioning System Problem in an Embodiment Design Context Using Constraint Satisfaction Techniques
18
Solving the Salinity Control Problem in a Potable Water System
33
Exploring Different ConstraintBased Modelings for Program Verification
49
An Application of Constraint Programming to Generating Detailed Operations Schedules for Steel Manufacturing
64
An Efficient Model and Strategy for the Steel Mill Slab Design Problem
77
Towards Robust CNF Encodings of Cardinality Constraints
483
ANDOR Multivalued Decision Diagrams for Constraint Optimization
498
Parallelizing Constraint Programs Transparently
514
Towards a Standard CP Modelling Language
529
Propagation Lazy Clause Generation
544
Boosting Probabilistic Choice Operators
559
A Multiengine Solver for Quantified Boolean Formulas
574
Decomposing Global Grammar Constraints
590

ConstraintBased Temporal Reasoning for ELearning with LODE
90
Scheduling for Cellular Manufacturing
105
A Constraint Store Based on Multivalued Decision Diagrams
118
GAC Via Unit Propagation
133
Solution Directed Backjumping for QCSP
148
Reformulating CSPs for Scalability with Application to Geospatial Reasoning
164
A Generic Geometrical Constraint Kernel in Space and Time for Handling Polymorphic kDimensional Objects
180
Local Symmetry Breaking During Search in CSPs
195
Encodings of the SEQUENCE Constraint
210
On Inconsistent ClauseSubsets for MaxSAT Solving
225
An Abstract Interpretation Based Combinator for Modelling While Loops in Constraint Programming
241
Tradeoffs in the Complexity of Backdoor Detection
256
ModelDriven Visualizations of ConstraintBased Local Search
271
Dealing with Incomplete Preferences in Soft Constraint Problems
286
Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure
301
Provide a FinerGrained Explanation of Unsatisfiability
317
An Integrated White+Black Box Approach for Designing and Tuning Stochastic Local Search
332
Limitations of Restricted Branching in Clause Learning
348
Dynamic Management of Heuristics for Solving Structured CSPs
364
A Compression Algorithm for Large Arity Extensional Constraints
379
Valid Inequality Based Lower Bounds for WCSP
394
Advisors for Incremental Propagation
409
Breaking Symmetry of Interchangeable Variables and Values
423
Path Consistency by Dual Consistency
438
Pruning by Inconsistent Partial State Dominance
453
Scheduling Conditional Task Graphs
468
Structural Relaxations by Variable Renaming and Their Compilation for Solving MinCostSAT
605
BoundConsistent Deviation Constraint
620
Constructive Interval Disjunction
635
An LPBased Heuristic for Optimal Planning
651
A CostBased Model and Algorithms for Interleaving Solving and Elicitation of CSPs
666
On Universal Restart Strategies for Backtracking Search
681
Hierarchical Hardness Models for SAT
696
The Design and Analysis of an Algorithm Portfolio for SAT
712
Filtering for Subgraph Isomorphism
728
Solution Counting Algorithms for ConstraintCentered Search Heuristics
743
MinDomain Ordering for Asynchronous Backtracking
758
A Security Scenario
773
An Analysis of Slow Convergence in Interval Propagation
790
Hierarchies and Collapses
798
Eligible and Frozen Constraints for Solving Temporal Qualitative Constraint Networks
806
The LogSupport Encoding of CSP into SAT
815
Sampling Strategies and Variable Selection in Weighted Degree Heuristics
831
A Case for Simple SAT Solvers
839
CPBased Local Branching
847
Strong Controllability of Disjunctive Temporal Problems with Uncertainty
856
Exploiting SingleCycle Symmetries in BranchandPrune algorithms
864
Constraint Symmetry for the Soft CSP
872
Breaking Value Symmetry
880
Author Index
888
Copyright

Other editions - View all

Common terms and phrases

Popular passages

Page 863 - This material is based in part upon work supported by the Defense Advanced Research Projects Agency (DARPA) under Contract No.
Page 33 - The work described in this paper was substantially supported by a grant from the Research Grants Council of the Hong Kong Special Administrative Region, China (Project No.

Bibliographic information