Alan M . Frisch and Jimmy Lee ( Ed . ) Constraint Modelling
نویسندگان
چکیده
We study decompositions of NVALUE, a global constraint that can be used to model a wide range of problems where values need to be counted. Whilst decomposition typically hinders propagation, we identify one decomposition that maintains a global view as enforcing bound consistency on the decomposition achieves bound consistency on the original global NVALUE constraint. Such decompositions offer the prospect for advanced solving techniques like nogood learning and impact based branching heuristics. They may also help SAT and IP solvers take advantage of the propagation of global constraints.
منابع مشابه
The Rules of Constraint Modelling: An Overview
We address a major bottleneck in the use of constraint programming: modelling. Our system CONJURE automatically refines a specification of a problem in our abstract constraint specification language, ESSENCE, into a set of alternative constraint programs, thus automating an important part of the modelling process and helping to reduce the modelling bottleneck significantly.
متن کاملAutomated Modelling and Model Selection in Constraint Programming Current Achievements and Future Directions
متن کامل
Conjure Revisited: Towards Automated Constraint Modelling
Automating the constraint modelling process is one of the key challenges facing the constraints field, and one of the principal obstacles preventing widespread adoption of constraint solving. This paper focuses on the refinement-based approach to automated modelling, where a user specifies a problem in an abstract constraint specification language and it is then automatically refined into a con...
متن کاملExtensible Automated Constraint Modelling
In constraint solving, a critical bottleneck is the formulation of an effective constraint model of a given problem. The CONJURE system described in this paper, a substantial step forward over prototype versions of CONJURE previously reported, makes a valuable contribution to the automation of constraint modelling by automatically producing constraint models from their specifications in the abs...
متن کاملModelling and Reformulating Constraint Satisfaction Problems
The solution density of a constraint problem can have a significant effect on local search performance. This paper describes a reformulation technique for artificially increasing solution density: relaxing the model in such a way that relaxed solutions are dominated by real solutions, and can be transformed into them. On an open stack minimization problem this technique can exponentially increa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009