Computing All Optimal Solutions in Satisfiability Problems with Preferences.
Emanuele Di RosaEnrico GiunchigliaMarco MarateaPublished in: CP (2008)
Keyphrases
- satisfiability problem
- optimal solution
- np complete
- sat problem
- temporal logic
- search algorithm
- phase transition
- stochastic local search algorithms
- np hard
- solving hard
- stochastic local search
- search space
- pspace complete
- mazurkiewicz traces
- finite domain
- lower bound
- orders of magnitude
- max sat
- objective function
- branch and bound
- linear programming
- davis putnam
- dynamic programming
- evolutionary algorithm