The Parameterized Complexity of Constraint Satisfaction and Reasoning.
Stefan SzeiderPublished in: INAP/WLP (2011)
Keyphrases
- constraint satisfaction
- parameterized complexity
- probabilistic reasoning
- constraint satisfaction problems
- global constraints
- constraint programming
- constraint propagation
- knowledge base
- constraint relaxation
- phase transition
- heuristic search
- fixed parameter tractable
- arc consistency
- soft constraints
- automated reasoning
- russian doll search
- robust fault detection
- abstract argumentation
- symmetry breaking
- combinatorial problems
- constraint networks
- knowledge representation
- np complete
- genetic algorithm
- sat solvers