Dynamic Constraint Satisfaction Problem Solver with Part-Whole Hierarchy Constraints

1. A non-transitory computer readable medium having instructions stored thereon that, when executed by a processor, causes the processor to function as a constraint solver for solving a constraint satisfaction problem (CSP) model, wherein the model comprises a least one part-whole hierarchy, the solving comprising: for at least one part of the part-whole hierarchy, assigning variables comprising selected, quantity, and relative quantity; automatically applying at least one part-whole hierarchy constraint to the part when a parent for the part is selected, wherein the constraint is based on the selected variable, quantity variable and relative quantity variable assigned to the part; and solving the model and generating a solution; wherein the selected variable represents whether the part is included in the solution for the CSP, the quantity variable represents a total number of instances of the part in the solution summed across all instances of the parent in the CSP, and the relative quantity variable represents a number of instances of the part per unit quantity of the parent in the CSP; wherein the part is a sub-problem of the solution for the CSP and comprises variables and constraints; wherein an automatically applied part-whole hierarchy constraint comprises a quantity of the part is equal to a quantity of its parent multiplied by its relative quantity variable, and solving the model comprises dynamically generating additional instances of the part to equal the quantity of its parent multiplied by its relative quantity variable.

2. The computer readable medium of claim 1 , wherein the quantity variable comprises one of: the part is mandatory for its parent, the part is optional for its parent, or multiple instances of the part can exist within its parent.

3. The computer readable medium of claim 1 , further comprising classifying the part as static or dynamic, wherein when the part is classified as static the part is automatically generated when its parent part is generated.

4. The computer readable medium of claim 1 , wherein the part-whole hierarchy constraint comprises selecting the part only if the quantity variable is greater than zero.

5. The computer readable medium of claim 1 , wherein the part-whole hierarchy constraint comprises defining a minimum quantity value wherein the relative quantity variable is greater than or equal to the minimum quantity value.

6. The computer readable medium of claim 1 , wherein the part-whole hierarchy constraint comprises defining a maximum quantity value wherein the relative quantity variable is no greater than the maximum quantity value.

7. The computer readable medium of claim 1 , wherein the part-whole hierarchy constraint comprises defining a default quantity value for the relative quantity variable.

8. The computer readable medium of claim 1 , wherein the part-whole hierarchy constraint comprises defining the part to be either required or optional for its parent.

9. The computer readable medium of claim 1 , wherein the model corresponds to a product configuration.

10. A computer implemented method of solving a constraint satisfaction problem (CSP) model, wherein the model comprises a least one part-whole hierarchy, the method comprising: for at least one part of the part-whole hierarchy, assigning variables comprising selected, quantity, and relative quantity; automatically applying at least one part-whole hierarchy constraint to the part when a parent for the part is selected, wherein the constraint is based on the selected variable, quantity variable and relative quantity variable assigned to the part; and solving the model and generating a solution; wherein the selected variable represents whether the part is included in the solution for the CSP, the quantity variable represents a total number of instances of the part in the solution summed across all instances of the parent in the CSP, and the relative quantity variable represents a number of instances of the part per unit quantity of the parent in the CSP; wherein the part is a sub-problem of the solution for the CSP and comprises variables and constraints; wherein an automatically applied part-whole hierarchy constraint comprises a quantity of the part is equal to a quantity of its parent multiplied by its relative quantity variable, and solving the model comprises dynamically generating additional instances of the part to equal the quantity of its parent multiplied by its relative quantity variable.

11. The method of claim 10 , further comprising classifying the part as static or dynamic, wherein when the part is classified as static the part is automatically generated when its parent part is generated.

12. The method of claim 10 , wherein the model corresponds to a product configuration.

13. The method of claim 10 , wherein the part-whole hierarchy constraint comprises defining a minimum quantity value wherein the relative quantity variable is greater than or equal to the minimum quantity value.

14. A constraint solver system comprising: a processor; a memory coupled to the processor comprising a constraint solver module; and a stored constraint satisfaction problem (CSP) model, wherein the model comprises a least one part-whole hierarchy; wherein the constraint solver module comprises functionality that, for at least one part of the part-whole hierarchy, assigns variables comprising selected, quantity, and relative quantity, automatically applies at least one part-whole hierarchy constraint to the part when a parent for the part is selected, wherein the constraint is based on the selected variable, quantity variable and relative quantity variable assigned to the part, and solves the model and generates a solution; wherein the selected variable represents whether the part is included in the solution for the CSP, the quantity variable represents a total number of instances of the part in the solution summed across all instances of the parent in the CSP, and the relative quantity variable represents a number of instances of the part per unit quantity of the parent in the CSP; wherein the part is a sub-problem of the solution for the CSP and comprises variables and constraints; wherein an automatically applied part-whole hierarchy constraint comprises a quantity of the part is equal to a quantity of its parent multiplied by its relative quantity variable, and solving the model comprises dynamically generating additional instances of the part to equal the quantity of its parent multiplied by its relative quantity variable.

15. The constraint solver system of claim 14 , the functionality further comprising classifying the part as static or dynamic, wherein when the part is classified as static the part is automatically generated when its parent part is generated.

16. The system of claim 14 , wherein the model corresponds to a product configuration.

17. The system of claim 14 , wherein the part-whole hierarchy constraint comprises defining a minimum quantity value wherein the relative quantity variable is greater than or equal to the minimum quantity value.