Self-control of the time complexity of a constraint satisfaction problem solver program.
Yönet A. EracarMieczyslaw M. KokarPublished in: J. Syst. Softw. (2012)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- constraint solving
- constraint solver
- constraint propagation
- constraint programming
- hard constraints
- np complete
- soft constraints
- search space
- partial constraint satisfaction
- decomposition methods
- np hard
- constraint solvers
- combinatorial problems
- sat problem
- constraint networks
- arc consistency
- finite domain
- problems in artificial intelligence
- tractable classes
- disjunctive temporal
- temporal constraints
- constraint problems
- tractable subclasses
- constraint graph
- worst case
- pseudo boolean optimization
- decision problems
- backtracking algorithm
- sat solvers
- space complexity
- global constraints