Formulating constraint satisfaction problems for the inspection of configuration rules.
Anna TidstamJohan MalmqvistAlexey VoronovKnut ÅkessonMartin FabianPublished in: Artif. Intell. Eng. Des. Anal. Manuf. (2016)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- product configuration
- configuration problems
- constraint programming
- constraint propagation
- combinatorial problems
- search space
- np complete
- np hard
- non binary
- arc consistency
- constraint solving
- soft constraints
- constraint networks
- decomposition methods
- dynamic constraint satisfaction problems
- global constraints
- constraint optimization
- tractable subclasses
- pseudo boolean optimization
- computational problems
- backtracking search
- partial constraint satisfaction
- lower bound
- temporal constraints
- association rules