New Local Search Approximation Techniques for Maximum Generalized Satisfiability Problems.
Paola AlimontiPublished in: Inf. Process. Lett. (1996)
Keyphrases
- satisfiability problem
- search algorithm
- stochastic local search
- np complete
- search procedures
- phase transition
- sat problem
- graph coloring problems
- stochastic local search algorithms
- temporal logic
- solving hard
- pspace complete
- clause learning
- sat instances
- genetic algorithm
- constraint satisfaction problems
- search space
- combinatorial optimization
- mazurkiewicz traces
- special case
- randomly generated
- search strategies
- propositional satisfiability
- search methods
- finite domain
- modal logic
- search strategy
- computational complexity
- branch and bound
- tabu search
- random sat
- particle swarm optimization