Characterizing Arithmetic Circuit Classes by Constraint Satisfaction Problems - (Extended Abstract).
Stefan MengelPublished in: ICALP (1) (2011)
Keyphrases
- extended abstract
- constraint satisfaction problems
- constraint satisfaction
- tractable classes
- constraint programming
- constraint propagation
- search space
- np complete
- combinatorial problems
- non binary
- np hard
- arc consistency
- computational problems
- tractable subclasses
- decomposition methods
- constraint solving
- forward checking
- finite domain
- constraint optimization
- pseudo boolean optimization
- product configuration
- constraint problems
- sat problem
- partial constraint satisfaction
- reasoning problems
- backtracking search
- temporal reasoning