most citedCircuit Complexity and Decompositions of Global Constraints

58 citations · 92 across the 6 of their papers we have counts for

collaborators

6 papers

cs.AI20099 cited

Breaking Generator Symmetry

George Katsirelos, Nina Narodytska, Toby Walsh

Dealing with large numbers of symmetries is often problematic. One solution is to focus on just symmetries that generate the symmetry group. Whilst there are special cases where br…

cs.AI2009

Flow-Based Propagators for the SEQUENCE and Related Global Constraints

Michael J. Maher, Nina Narodytska, Claude-Guy Quimper +1

We propose new filtering algorithms for the SEQUENCE constraint and some extensions of the SEQUENCE constraint based on network flows. We enforce domain consistency on the SEQUENCE…

cs.AI20091 cited

Decomposition of the NVALUE constraint

Christian Bessiere, George Katsirelos, Nina Narodytska +2

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 pr…

cs.AI20091 cited

Restricted Global Grammar Constraints

George Katsirelos, Sebastian Maneth, Nina Narodytska +1

We investigate the global GRAMMAR constraint over restricted classes of context free grammars like deterministic and unambiguous context-free grammars. We show that detecting disen…

cs.AI200958 cited

Circuit Complexity and Decompositions of Global Constraints

Christian Bessiere, George Katsirelos, Nina Narodytska +1

We show that tools from circuit complexity can be used to study decompositions of global constraints. In particular, we study decompositions of global constraints into conjunctive…

cs.AI200923 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…