158 citations · 391 across the 15 of their papers we have counts for
Showing cs.AIShow all
2 papers · 1 filter
cs.AI2021★ 1 cited
Solving the Workflow Satisfiability Problem using General Purpose Solvers
Daniel Karapetyan, Gregory Gutin
The workflow satisfiability problem (WSP) is a well-studied problem in access control seeking allocation of authorised users to every step of the workflow, subject to workflow spec…
cs.AI2016
Pattern-Based Approach to the Workflow Satisfiability Problem with User-Independent Constraints
Daniel Karapetyan, Andrew J. Parkes, Gregory Gutin +1
The fixed parameter tractable (FPT) approach is a powerful tool in tackling computationally hard problems. In this paper, we link FPT results to classic artificial intelligence (AI…