6 citations · 9 across the 6 of their papers we have counts for
Showing 2013 · cs.AIShow all
2 papers · 2 filters
cs.AI2013★ 2 cited
Tractable Combinations of Global Constraints
David A. Cohen, Peter G. Jeavons, Evgenij Thorstensen +1
We study the complexity of constraint satisfaction problems involving global constraints, i.e., special-purpose constraints provided by a solver and represented implicitly by a par…
cs.AI2013
Lifting Structural Tractability to CSP with Global Constraints
Evgenij Thorstensen
A wide range of problems can be modelled as constraint satisfaction problems (CSPs), that is, a set of constraints that must be satisfied simultaneously. Constraints can either be…