Solving Non-Boolean Satisfiability Problems with Stochastic Local Search.
Alan M. FrischTimothy J. PeugniezPublished in: IJCAI (2001)
Keyphrases
- stochastic local search
- satisfiability problem
- solving hard
- davis putnam logemann loveland
- combinatorial optimisation
- np complete
- conjunctive normal form
- temporal logic
- phase transition
- sat instances
- search algorithm
- sat problem
- finite domain
- randomly generated
- random sat instances
- boolean functions
- reinforcement learning
- propositional logic
- model checking
- davis putnam
- heuristic search
- graph coloring problems
- dynamic programming
- systematic search algorithms