Parameterized Complexity of Weighted Satisfiability Problems.

Nadia Creignou Heribert Vollmer

Published in: SAT (2012)

Keyphrases

satisfiability problem
parameterized complexity
np complete
fixed parameter tractable
search algorithm
temporal logic
phase transition
sat problem
np hard
global constraints
stochastic local search
sat instances
computational complexity
max sat
lower bound
data exchange
conjunctive queries
symmetry breaking