51 citations · 203 across the 13 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.DS2015★ 19 cited
Algorithms for the workflow satisfiability problem engineered for counting constraints
D. Cohen, J. Crampton, A. Gagarin +2
The workflow satisfiability problem (WSP) asks whether there exists an assignment of authorized users to the steps in a workflow specification that satisfies the constraints in the…
cs.CC2015★ 21 cited
Variable and value elimination in binary constraint satisfaction via forbidden patterns
David A. Cohen, Martin C. Cooper, Guillaume Escamocher +1
Variable or value elimination in a constraint satisfaction problem (CSP) can be used in preprocessing or during search to reduce search space size. A variable elimination rule (val…