23 citations · 24 across the 3 of their papers we have counts for
Showing cs.AIShow all
2 papers · 1 filter
cs.AI2009★ 23 cited
Decompositions of All Different, Global Cardinality and Related Constraints
Christian Bessiere, George Katsirelos, Nina Narodytska +2
We show that some common and important global constraints like ALL-DIFFERENT and GCC can be decomposed into simple arithmetic constraints on which we achieve bound or range consist…
cs.AI2009★ 15 cited
Decompositions of Grammar Constraints
Claude-Guy Quimper, Toby Walsh
A wide range of constraints can be compactly specified using automata or formal languages. In a sequence of recent papers, we have shown that an effective means to reason with such…