On the Workflow Satisfiability Problem with Class-Independent Constraints for Hierarchical Organizations.
Jason CramptonAndrei GagarinGregory Z. GutinMark JonesMagnus WahlströmPublished in: ACM Trans. Priv. Secur. (2016)
Keyphrases
- satisfiability problem
- np complete
- temporal logic
- phase transition
- search algorithm
- finite domain
- sat problem
- stochastic local search algorithms
- constraint satisfaction
- stochastic local search
- knowledge representation
- workflow processes
- pspace complete
- sat instances
- business processes
- virtual enterprise
- linear constraints
- tabu search