On the Parameterized Complexity and Kernelization of the Workflow Satisfiability Problem.
Jason CramptonGregory Z. GutinAnders YeoPublished in: ACM Trans. Inf. Syst. Secur. (2013)
Keyphrases
- satisfiability problem
- parameterized complexity
- np complete
- fixed parameter tractable
- temporal logic
- phase transition
- global constraints
- search algorithm
- bounded treewidth
- sat problem
- stochastic local search algorithms
- np hard
- max sat
- stochastic local search
- constraint satisfaction problems
- sat instances
- symmetry breaking
- modal logic
- constraint satisfaction