On the Workflow Satisfiability Problem with Class-independent Constraints.
Jason CramptonAndrei V. GagarinGregory Z. GutinMark JonesPublished in: IPEC (2015)
Keyphrases
- satisfiability problem
- np complete
- finite domain
- phase transition
- search algorithm
- temporal logic
- stochastic local search algorithms
- decision procedures
- pspace complete
- special case
- orders of magnitude
- constraint satisfaction
- combinatorial problems
- sat problem
- max sat
- sat instances
- weighted max sat
- conjunctive normal form
- knowledge base
- computational complexity
- xml documents
- constraint programming
- constraint satisfaction problems