On the parameterized complexity of the workflow satisfiability problem.
Jason CramptonGregory Z. GutinAnders YeoPublished in: CCS (2012)
Keyphrases
- satisfiability problem
- parameterized complexity
- np complete
- fixed parameter tractable
- temporal logic
- search algorithm
- phase transition
- stochastic local search
- sat problem
- global constraints
- bounded treewidth
- stochastic local search algorithms
- randomly generated
- symmetry breaking
- constraint satisfaction problems
- conjunctive queries
- computational complexity
- expressive power
- model checking
- reinforcement learning