A new Approach for Solving Satisfiability Problems with Qualitative Preferences.
Emanuele Di RosaEnrico GiunchigliaMarco MarateaPublished in: ECAI (2008)
Keyphrases
- satisfiability problem
- qualitative preferences
- solving hard
- sat instances
- stochastic local search
- np complete
- temporal logic
- search algorithm
- sat problem
- finite domain
- phase transition
- graph coloring problems
- pspace complete
- stochastic local search algorithms
- davis putnam
- davis putnam logemann loveland
- max sat
- orders of magnitude
- np hard
- combinatorial problems
- random sat
- randomly generated