On the Parameterized Complexity of the Workflow Satisfiability Problem
Jason CramptonGregory Z. GutinAnders YeoPublished in: CoRR (2012)
Keyphrases
- satisfiability problem
- parameterized complexity
- np complete
- fixed parameter tractable
- temporal logic
- phase transition
- search algorithm
- global constraints
- sat problem
- stochastic local search algorithms
- bounded treewidth
- stochastic local search
- np hard
- max sat
- conjunctive queries
- incomplete information
- sat instances
- symmetry breaking
- special case
- constraint satisfaction problems