Parameterized Complexity of Weighted Satisfiability Problems: Decision, Enumeration, Counting.
Nadia CreignouHeribert VollmerPublished in: Fundam. Informaticae (2015)
Keyphrases
- satisfiability problem
- parameterized complexity
- np complete
- fixed parameter tractable
- search algorithm
- phase transition
- sat problem
- temporal logic
- decision makers
- stochastic local search
- np hard
- bounded treewidth
- mazurkiewicz traces
- sat instances
- global constraints
- conjunctive queries
- decision problems
- dynamic programming
- randomly generated
- max sat
- search space
- partial order
- symmetry breaking
- special case