Abstract:
The effective minimal join graph set synthesis algorithm (of self-managing cli-ques)from a given maximal knowledge pattern set and two its improvements, each of which is actualized in an algorithm, exists, however there is no algorithm that implements the two improvements. The goal of the work is to designing a new algorithm that actualizes all known improvements of the basic algorithm, and thus, is the most effective one. Such an algorithm implementing suggested improvement is designed and correctness of its work is proven.