most citedCircuit Complexity and Decompositions of Global Constraints

58 citations · 87 across the 5 of their papers we have counts for

collaborators
Showing cs.AIShow all

5 papers · 1 filter

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…

cs.AI20095 cited

Combining Symmetry Breaking and Global Constraints

George Katsirelos, Nina Narodytska, Toby Walsh

We propose a new family of constraints which combine together lexicographical ordering constraints for symmetry breaking with other common global constraints. We give a general pur…

cs.AI2009

Reformulating Global Grammar Constraints

George Katsirelos, Nina Narodytska, Toby Walsh

An attractive mechanism to specify global constraints in rostering and other domains is via formal languages. For instance, the Regular and Grammar constraints specify constraints…