Optimal competence set expansion using deduction graphs

A competence set is a collection of skills used to solve a problem. Based on deduction graph concepts, this paper proposes a method of finding an optimal process so as to expand a decision maker's competence set to enable him to solve his problem confidently. Using the concept of minimum spanning tree, Yu and Zhang addressed the problem of the optimal expansion of competence sets. In contrast, the method proposed here enjoys the following advantages: it can deal with more general problems involving intermediate skills and compound skills; it can find the optimal solution by utilizing a 0–1 integer program; and it can be directly extended to treat multilevel competence set problems, and thus is more practically useful.This work was supported by the National Science Council, Taipei, Taiwan, Republic of China, Grant No. NSC-81-0301-H-009-501.