Solving satisfiability problems with preferences.
Emanuele Di RosaEnrico GiunchigliaMarco MarateaPublished in: Constraints An Int. J. (2010)
Keyphrases
- satisfiability problem
- solving hard
- stochastic local search
- np complete
- phase transition
- sat instances
- finite domain
- temporal logic
- search algorithm
- davis putnam logemann loveland
- sat problem
- pspace complete
- graph coloring problems
- davis putnam
- stochastic local search algorithms
- mazurkiewicz traces
- combinatorial problems
- max sat
- cl pc