the proceedings contain 126 papers. the special focus in this conference is on principles and practice of constraintprogramming. the topics include: Recent progress in propositional reasoning and search;a new applica...
ISBN:
(纸本)3540202021
the proceedings contain 126 papers. the special focus in this conference is on principles and practice of constraintprogramming. the topics include: Recent progress in propositional reasoning and search;a new application area for search algorithms;languages versus packages for constraint problem solving;constraint patterns;control abstractions for local search;improved algorithms for counting solutions in constraint satisfaction problems;boosting chaff’s performance by incorporating CSP heuristics;efficient CNF encoding of boolean cardinality constraints;a two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows;solving finite domain constraint hierarchies by local consistency and tree search;a constraintprogramming application to staff scheduling in health care;constraint-based optimization withthe minimax decision criterion;an algebraic approach to multi-sorted constraints;polynomial-time algorithms;box constraint collections for adhoc constraints;propagation redundancy in redundant modelling;complexity and multimorphisms;constraint satisfaction differential problems;a wealth of sat distributions with planted assignments;redundant modeling for the quasigroup completion problem;open constraint optimization;constraints for breaking more row and column symmetries;generic SBDD using computational group theory;using stochastic local search to solve quantified boolean formulae;solving max-SAT as weighted CSP;constraint reasoning over strings;tractability by approximating constraint languages;constraints for probabilistic reasoning in logic programming;constraintprogramming for modelling and solving modal satisfiability;distributed forward checking and a new class of binary CSPs for which arc-consistency is a decision procedure.
this article follows a tutorial, given by the authors on dynamic constraint solving at cp 2003 (Ninthinternationalconference on principles and practice of constraintprogramming) in Kinsale, Ireland (Verfaillie, G.,...
详细信息
this article follows a tutorial, given by the authors on dynamic constraint solving at cp 2003 (Ninthinternationalconference on principles and practice of constraintprogramming) in Kinsale, Ireland (Verfaillie, G., & Jussien, N. (2003). It aims at offering an overview of the main approaches and techniques that have been proposed in the domain of constraint satisfaction to deal with uncertain and dynamic environments.
One strand of cp research seeks to design a small set of primitives and operators that can be used to build an appropriate algorithm for solving any given combinatorial problem. the aim is to "package" cp, s...
详细信息
ISBN:
(纸本)3540202021
One strand of cp research seeks to design a small set of primitives and operators that can be used to build an appropriate algorithm for solving any given combinatorial problem. the aim is to "package" cp, simplifying its use, in contrast to current systems which offer application developers a full constraintprogramming language. In this talk we examine the risks of this line of research, and argue that our field is still too immature to be ready for "packaging".
constraint models contain a number of common patterns. For example, many constraint models involve an array of decision variables with symmetric rows and/or columns. By documenting such constraint patterns, we can sha...
详细信息
ISBN:
(纸本)3540202021
constraint models contain a number of common patterns. For example, many constraint models involve an array of decision variables with symmetric rows and/or columns. By documenting such constraint patterns, we can share modelling expertise. constraint solvers can also be extended to exploit such patterns. For example, we can develop specialized methods like the global lexicographical ordering constraint for breaking such row and column symmetry.
暂无评论