The Exact Closest String Problem as a Constraint Satisfaction Problem
Tom KelseyLars KotthoffPublished in: CoRR (2010)
Keyphrases
- constraint satisfaction problems
- closest string
- constraint satisfaction
- constraint programming
- constraint propagation
- np hard
- np complete
- arc consistency
- search space
- non binary
- feasible solution
- practical solutions
- partial constraint satisfaction
- approximation algorithms
- constraint networks
- soft constraints
- constraint solving
- boolean functions
- temporal constraints
- decomposition methods
- search algorithm
- finite domain
- tractable subclasses
- disjunctive temporal