Solving the Workflow Satisfiability Problem using General Purpose Solvers.
Daniel KarapetyanGregory Z. GutinPublished in: CoRR (2021)
Keyphrases
- satisfiability problem
- sat instances
- general purpose
- solving hard
- stochastic local search
- np complete
- sat problem
- sat solvers
- search algorithm
- temporal logic
- phase transition
- finite domain
- davis putnam logemann loveland
- systematic search algorithms
- randomly generated
- stochastic local search algorithms
- weighted max sat
- propositional satisfiability
- pspace complete
- graph coloring problems
- decision procedures
- clause learning
- computational properties
- random sat
- programming language
- computational complexity
- boolean satisfiability
- conjunctive normal form
- search tree
- constraint programming
- constraint satisfaction
- mazurkiewicz traces