Iterative Plan Construction for the Workflow Satisfiability Problem.
David A. CohenJason CramptonAndrei GagarinGregory Z. GutinMark JonesPublished in: J. Artif. Intell. Res. (2014)
Keyphrases
- satisfiability problem
- np complete
- search algorithm
- temporal logic
- phase transition
- stochastic local search algorithms
- sat problem
- stochastic local search
- workflow management systems
- max sat
- randomly generated
- mazurkiewicz traces
- pspace complete
- sat instances
- modal logic
- constraint satisfaction problems
- business processes
- finite domain
- upper bound
- np hard