A Dichotomy Theorem for Maximum Generalized Satisfiability Problems.

Published in: J. Comput. Syst. Sci. (1995)

Keyphrases

satisfiability problem
np complete
search algorithm
temporal logic
phase transition
solving hard
davis putnam
sat problem
stochastic local search
stochastic local search algorithms
sat instances
combinatorial problems
pspace complete
max sat
constraint satisfaction
lower bound
genetic algorithm