Automatic Generation of Music Programs
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
A Filtering Algorithm for the Stretch Constraint
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Entropy: a consolidation manager for clusters
Proceedings of the 2009 ACM SIGPLAN/SIGOPS international conference on Virtual execution environments
Six Ways of Integrating Symmetries within Non-overlapping Constraints
CPAIOR '09 Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
SLIDE: A Useful Special Case of the CARDPATH Constraint
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
The complexity of global constraints
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Combining Symmetry Breaking and Global Constraints
Recent Advances in Constraints
Filtering algorithms for the NVALUE constraint
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
A generalized arc-consistency algorithm for a class of counting constraints
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
The seqbin constraint revisited
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
| Hi-index | 0.00 |
This paper introduces the Increasing_Nvalue constraint, which restricts the number of distinct values assigned to a sequence of variables so that each variable in the sequence is less than or equal to its successor. This constraint is a specialization of the Nvalue constraint, motivated by symmetry breaking. Propagating the Nvalue constraint is known as an NP-hard problem. However, we show that the chain of non strict inequalities on the variables makes the problem polynomial. We propose an algorithm achieving generalized arc-consistency in O(ΣDi) time, where ΣDi is the sum of domain sizes. This algorithm is an improvement of filtering algorithms obtained by the automaton-based or the Slide-based reformulations. We evaluate our constraint on a resource allocation problem.