vs PSpace Dichotomy for the Quantified Constraint Satisfaction Problem.
Dmitriy ZhukPublished in: CoRR (2024)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- search space
- np complete
- constraint propagation
- constraint programming
- non binary
- np hard
- partial constraint satisfaction
- constraint solving
- arc consistency
- constraint networks
- soft constraints
- temporal logic
- global constraints
- product configuration
- finding optimal solutions
- tractable subclasses
- constraint graph
- finite domain
- forward checking
- pseudo boolean optimization
- objective function
- distributed constraint satisfaction
- backtracking algorithm
- complexity bounds
- constraint solver
- reasoning problems
- hard constraints
- decomposition methods
- decision procedures
- temporal constraints