Tree clustering for constraint networks (research note)
Artificial Intelligence
A filtering algorithm for constraints of difference in CSPs
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
On the Desirability of Acyclic Database Schemes
Journal of the ACM (JACM)
Revisiting the Cardinality Operator and Introducing the Cardinality-Path Constraint Family
Proceedings of the 17th International Conference on Logic Programming
Modelling Resource Transitions in Constraint-Based Scheduling
SOFSEM '02 Proceedings of the 29th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Global Constraints for Lexicographic Orderings
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
The State of the Art of Nurse Rostering
Journal of Scheduling
On global warming: Flow-based soft global constraints
Journal of Heuristics
Reformulating global constraints: the slide and regular constraints
SARA'07 Proceedings of the 7th International conference on Abstraction, reformulation, and approximation
Encodings of the SEQUENCE constraint
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Revisiting the sequence constraint
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Computing leximin-optimal solutions in constraint networks
Artificial Intelligence
Circuit complexity and decompositions of global constraints
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Decompositions of all different, global cardinality and related constraints
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Open contractible global constraints
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
SOGgy constraints: soft open global constraints
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
MDD propagators with explanation
Constraints
On matrices, automata, and double counting
CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
The increasing nvalue constraint
CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Constraint satisfaction problems: convexity makes all different constraints tractable
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
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
ILP'11 Proceedings of the 21st international conference on Inductive Logic Programming
An optimal arc consistency algorithm for a chain of atmost constraints with cardinality
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Including soft global constraints in DCOPs
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
The seqbin constraint revisited
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Constraint satisfaction problems: Convexity makes AllDifferent constraints tractable
Theoretical Computer Science
The regulargcc matrix constraint
AI'12 Proceedings of the 25th Australasian joint conference on Advances in Artificial Intelligence
Hi-index | 0.00 |
We study the CARDPATH constraint. This ensures a given constraint holds a number of times down a sequence of variables. We show that SLIDE, a special case of CARDPATH where the slid constraint must hold always, can be used to encode a wide range of sliding sequence constraints including CARDPATH itself. We consider how to propagate SLIDE and provide a complete propagator for CARDPATH. Since propagation is NP-hard in general, we identify special cases where propagation takes polynomial time. Our experiments demonstrate that using SLIDE to encode global constraints can be as efficient and effective as specialised propagators.