Constraint Branching in Workflow Satisfiability Problem.
Gregory Z. GutinDaniel KarapetyanPublished in: SACMAT (2020)
Keyphrases
- conjunctive normal form
- satisfiability problem
- finite domain
- np complete
- search algorithm
- temporal logic
- phase transition
- branch and bound
- sat problem
- pspace complete
- sat instances
- max sat
- search tree
- stochastic local search algorithms
- stochastic local search
- workflow management systems
- global constraints
- branch and bound algorithm
- model checking
- np hard
- lower bound