The Workflow Satisfiability Problem with User-Independent Constraints.
Gregory Z. GutinPublished in: GC (2019)
Keyphrases
- satisfiability problem
- np complete
- temporal logic
- phase transition
- search algorithm
- finite domain
- stochastic local search algorithms
- constraint satisfaction
- sat problem
- max sat
- decision procedures
- reinforcement learning
- cellular automata
- model checking
- business processes
- knowledge representation
- computational complexity
- sat instances
- stochastic local search
- conjunctive normal form
- mazurkiewicz traces