Trends in Constraint ProgrammingFrédéric Benhamou, Narendra Jussien, Barry A. O'Sullivan 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. |
Contents
Constraint Programming Tools | |
The Next 10 Years of Constraint Programming | |
Constraint Propagation and Implementation | |
constraint programming by Luca Bortolussi and Alberto | |
Introduction | |
Introduction | |
Boosting SLS Using Resolution | |
Growing COMET | |
The Logic Behind Weighted | |
Finding Large Cligues using SAT Local | |
PART Vll Ccmstraints in Software Testing | |
A Symbolic Model for HashCollision Attacks | |
On the First SATCP Integration Workshop | |
Generating Random Values Using Binary | |
Symmetry Breaking in Subgraph Pattern | |
Introduction | |
An Intervalbased Approximation Method | |
Introduction | |
Strategy for Flaw Detection Based on | |
Cha ter 25 Trends and Issues in usin Constraint | |
MultiPoint Constructive Search for Constraint | |
Other editions - View all
Common terms and phrases
abstractions analysis applications approach arc consistency Artificial Intelligence assignment backtracking benchmarks binary Boolean bound calculate channeling constraints chapter Class clauses clique cluster combined COMET complexity Computer Science congruence domains considered constraint network constraint programming constraint propagation Constraint Satisfaction Problems constraint solvers constraint-based CP solvers CSP instance defined denote directed graphs distance constraints dynamic edge label efficient encoding example exploiting Figure filtering finite domain GAPLex Gecode global constraints graceful labeling graph HENTENRYCK heuristics ILOG Solver implementation injectivity integer interval interval analysis intruder language LNCS local search Max-SAT method model checking monomorphism MPCS multiset node nogoods optimization performance Practice of Constraint preprocessors Proceedings protein protocols random represent representation restart rule SAT solvers satisfies search algorithm search tree sequence solution solving Sonet Springer static structure subgraph symmetry breaking techniques theorem tree-decomposition value symmetries variable ordering variable symmetries WalkSAT WCSP workshop