A Complexity Analysis of Space-Bounded Learning Algorithms for the Constraint Satisfaction Problem.
Roberto J. Bayardo Jr.Daniel P. MirankerPublished in: AAAI/IAAI, Vol. 1 (1996)
Keyphrases
- first order logic
- complexity analysis
- constraint satisfaction problems
- search space
- constraint satisfaction
- learning algorithm
- constraint programming
- np complete
- constraint propagation
- arc consistency
- decomposition methods
- constraint problems
- constraint networks
- soft constraints
- constraint solving
- partial constraint satisfaction
- np hard
- pseudo boolean optimization
- non binary
- global constraints
- product configuration
- temporal constraints
- finite domain
- forward checking
- search tree
- theoretical analysis