Solving the Workflow Satisfiability Problem Using General Purpose Solvers.
Daniel KarapetyanGregory Z. GutinPublished in: IEEE Trans. Dependable Secur. Comput. (2023)
Keyphrases
- satisfiability problem
- sat instances
- general purpose
- solving hard
- stochastic local search
- sat solvers
- sat problem
- np complete
- search algorithm
- temporal logic
- phase transition
- randomly generated
- propositional satisfiability
- weighted max sat
- stochastic local search algorithms
- systematic search algorithms
- max sat
- pspace complete
- clause learning
- finite domain
- constraint satisfaction
- computational properties
- model checking
- programming language
- graph coloring problems
- conjunctive normal form
- reinforcement learning