Strict width for Constraint Satisfaction Problems over homogeneous strucures of finite duality.
Tomás NagyMichael PinskerPublished in: CoRR (2024)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- np complete
- search space
- constraint propagation
- linear programming
- np hard
- constraint programming
- combinatorial problems
- non binary
- computational problems
- constraint solving
- product configuration
- partial constraint satisfaction
- decomposition methods
- disjunctive temporal
- global constraints
- reasoning problems
- constraint solver
- finite domain
- satisfiability problem
- backtracking search
- finding optimal solutions
- tractable subclasses