Signal Processing Structures for Solving Conservative Constraint Satisfaction Problems.
Tarek A. LahlouThomas A. BaranPublished in: CoRR (2015)
Keyphrases
- constraint satisfaction problems
- signal processing
- constraint problems
- constraint satisfaction
- partial constraint satisfaction
- dynamic constraint satisfaction problems
- finite domain
- constraint optimization
- disjunctive temporal
- solving constraint satisfaction problems
- constraint propagation
- search space
- constraint solvers
- backtracking algorithm
- constraint programming
- graph coloring
- finding optimal solutions
- combinatorial problems
- np complete
- problems in artificial intelligence
- set bounds propagation
- graph coloring problems
- arc consistency
- configuration problems
- computational problems
- np hard
- product configuration
- sat encodings
- non binary
- solving planning problems
- np complete problems
- constraint networks
- constraint solving
- global constraints
- forward checking
- decomposition methods
- pattern recognition
- backtracking search
- reasoning problems
- randomly generated
- constraint graph
- solving problems