Solving Non-Boolean Satisfiability Problems with Stochastic Local Search: A Comparison of Encodings.
Alan M. FrischTimothy J. PeugniezAnthony J. DoggettPeter NightingalePublished in: J. Autom. Reason. (2005)
Keyphrases
- stochastic local search
- satisfiability problem
- sat instances
- solving hard
- combinatorial optimisation
- davis putnam logemann loveland
- search algorithm
- phase transition
- sat problem
- temporal logic
- conjunctive normal form
- np complete
- graph coloring problems
- random sat instances
- max sat
- randomly generated
- boolean satisfiability
- finite domain
- boolean formula
- boolean functions
- davis putnam
- sat solvers
- knowledge base
- systematic search algorithms
- computational properties
- constraint satisfaction problems
- np hard
- search space