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.
[1]
Holger H. Hoos,et al.
On the Run-time Behaviour of Stochastic Local Search Algorithms for SAT
,
1999,
AAAI/IAAI.
[2]
Ronen I. Brafman,et al.
A simplifier for propositional formulas with many binary clauses
,
2001,
IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).
[3]
Abdul Sattar,et al.
Old Resolution Meets Modern SLS
,
2005,
AAAI.
[4]
Holger H. Hoos,et al.
Scaling and Probabilistic Smoothing: Efficient Dynamic Local Search for SAT
,
2002,
CP.
[5]
Fahiem Bacchus,et al.
Effective Preprocessing with Hyper-Resolution and Equality Reduction
,
2003,
SAT.
[6]
Armin Biere,et al.
Effective Preprocessing in SAT Through Variable and Clause Elimination
,
2005,
SAT.
[7]
Dhiraj K. Pradhan,et al.
NiVER: Non Increasing Variable Elimination Resolution for Preprocessing SAT instances
,
2004,
SAT.
[8]
John Thornton,et al.
Additive versus Multiplicative Clause Weighting for SAT
,
2004,
AAAI.
[9]
Chu Min Li,et al.
Diversification and Determinism in Local Search for Satisfiability
,
2005,
SAT.
[10]
Chu Min Li,et al.
Look-Ahead Versus Look-Back for Satisfiability Problems
,
1997,
CP.
[11]
Bart Selman,et al.
Evidence for Invariants in Local Search
,
1997,
AAAI/IAAI.