9 citations · 10 across the 3 of their papers we have counts for
9 papers · 1 filter
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…
The Weighted CFG Constraint
George Katsirelos, Nina Narodytska, Toby Walsh
We introduce the weighted CFG constraint and propose a propagation algorithm that enforces domain consistency in time. We show that this algorithm can be decomposed int…
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…
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…
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…
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…