Research on Knowledge Representation Method of Product Configuration Problem Based on MDD

Currently, product configuration problems mostly use BDD[1] for space representation. But when using BDD to express the solution space, we need to convert the multivalue CSP problem into binary CSP problem. This process will consume product configuration time and space in great degree, which results in waste of resources. Based on the shortcomings, in this paper, MDD[2] is used to express the solution space of product configuration problem. MDD can represent multiplevalued structures directly. Thus, there is no need to carry out the binary conversion. Comparing with the binary converted BBD, the structure of MDD seems to be more simple and readable. After the product configurator was established by BDD and MDD in respectively, then according to the comparation of the data from Table 1, it can be clearly found that compared to BDD, MDD can be established in a shorter time, the occupied space is smaller, and its readability is stronger.