This title brings together the best papers on a range of topics raised at the annual International Conference on Principles and Practice of Constraint Programming. This conference provides papers and workshops which produce new insights, concepts and results which can then be used by those involved in this area to develop their own work.
İçerik tablosu
Introduction.
Part I. The Past, Present and Future of Constraint Programming.
Chapter 1. Constraint Programming as Declarative Algorithmics.
Chapter 2. Constraint Programming Tools.
Chapter 3. The Next 10 Years of Constraint Programming.
Chapter 4. Constraint Propagation and Implementation.
Chapter 5. On the First SAT/CP Integration Workshop.
Chapter 6. Constraint-based Methods for Bioinformatics.
Part II. Constraint Modeling and Reformulation.
Chapter 7. Improved Models and Reformulation.
Chapter 8. The Automatic Generation of Redundant Representations and Channeling Constraints.
Part III. Symmetry in Constraint Satisfaction Problems.
Chapter 9. GAPLex: Generalized Static Symmetry Breaking.
Chapter 10. Symmetry Breaking in Subgraph Pattern Matching.
Part IV. Interval Analysis, Constraint Propagation and Applications.
Chapter 11. Modeling and Solving of a Radio Antenna Deployment Support Application.
Chapter 12. Guaranteed Numerical Injectivity Test via Interval Analysis.
Chapter 13. An Interval-based Approximation Method for Discrete Changes in Hybrid cc.
Part V. Local Search Techniques in Constraint Satisfaction.
Chapter 14. Combining Adaptive Noise and Look-Ahead in Local Search for SAT.
Chapter 15. Finding Large Cliques using SAT Local Search.
Chapter 16. Multi-Point Constructive Search for Constraint Satisfaction: An Overview.
Chapter 17. Boosting SLS Using Resolution.
Chapter 18. Growing COMET.
Part VI. Preferences and Soft Constraints.
Chapter 19. The Logic Behind Weighted CSP.
Chapter 20. Dynamic Heuristics for Branch and Bound on Tree-Decomposition of Weighted CSPs.
Part VII. Constraints in Software Testing, Verification and Analysis.
Chapter 21. Extending a CP Solver with Congruences as Domains for Program Verification.
Chapter 22. Generating Random Values Using Binary Decision Diagrams and Convex Polyhedra.
Chapter 23. A Symbolic Model for Hash-Collision Attacks.
Chapter 24. Strategy for Flaw Detection Based on a Service-driven Model for Group Protocols.
Part VIII. Constraint Programming for Graphical Applications.
Chapter 25. Trends and Issues in using Constraint Programming for Graphical Applications.
Chapter 26. A Constraint Satisfaction Framework for Visual Problem Solving.
Chapter 27. Computer Graphics and Constraint Solving: An Application to Virtual Camera Control.
Index.
Yazar hakkında
Frédéric Benhamou is a Full Professor in the
Department of Computer Science and is Head of the Computer Science
Research Laboratory at Nantes Atlantic University, France.
Narendra Jussien is the President of the French Association
for Constraint Programming (AFPC) and is an Assistant Professor in
the Department of Computer Science at the Ecole des Mines de
Nantes, France.
Barry O’Sullivan is the Associate Director of the
Cork Constraint Computation Centre and is a Senior Lecturer in the
Department of Computer Science at University College Cork,
Ireland.