The Complexity of Resilience Problems via Valued Constraint Satisfaction Problems.
Manuel BodirskyZaneta SemanisinováCarsten LutzPublished in: LICS (2024)
Keyphrases
- constraint satisfaction problems
- np complete
- constraint satisfaction
- combinatorial problems
- constraint problems
- computational problems
- solving constraint satisfaction problems
- constraint programming
- finite domain
- pseudo boolean optimization
- soft constraints
- constraint propagation
- arc consistency
- decision problems
- non binary
- decomposition methods
- problems in artificial intelligence
- binary constraints
- partial constraint satisfaction
- tractable subclasses
- np hard
- constraint solving
- solving problems
- arithmetic constraints
- worst case
- search space
- difficult problems
- backtracking search
- constraint networks
- finding optimal solutions
- optimization problems
- dynamic constraint satisfaction problems