Configuration-Design Problem Solving
IEEE Expert: Intelligent Systems and Their Applications
Product Configuration Frameworks-A Survey
IEEE Intelligent Systems
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
A Brief Overview of Over-Constrained Systems
Over-Constrained Systems
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Solutions for product configuration management: An empirical study
Artificial Intelligence for Engineering Design, Analysis and Manufacturing
| Hi-index | 0.02 |
Constraint-based reasoning is often used to represent and find solutions to configuration problems. In the field of constraint satisfaction, the major focus has been on finding solutions to difficult problems. However, many real-life configuration problems, although not extremely complicated, have a huge number of solutions, few of which are acceptable from a practical standpoint. In this paper we present a value ordering heuristic for constraint solving that attempts to guide search toward solutions that are acceptable. More specifically, by considering weights that are assigned to values and sets of values, the heuristic can guide search toward solutions for which the total weight is within an acceptable interval. Experiments with random constraint satisfaction problems demonstrate that, when a problem has numerous solutions, the heuristic makes search extremely efficient even when there are relatively few solutions that fall within the interval of acceptable weights. In these cases, an algorithm that is very effective for finding a feasible solution to a given constraint satisfaction problem (the “maintained arc consistency” algorithm or MAC) does not find a solution in the same weight interval within a reasonable time when it is run without the heuristic.