Consensus methods for solving conflicts in incomplete ordered coverings are presented in this paper. The incomplete ordered coverings are expert information structures in many cases. This structure should be useful when an expert classifies all elements of a set in such a way that every element belongs to one class or to many classes. The consensus methods are one of the methods for solving knowledge conflicts in distributed systems. A definition of the incomplete ordered covering, transformation of the incomplete ordered covering in the other incomplete ordered covering, the definition of distance among incomplete ordered covering and the algorithms of consensus methods for criterion C1 and C2 are depicted in this work. Because the consensus algorithm according to the criterion C2 is a heuristic algorithm, the results of algorithm verification are presented.
Financed by the National Centre for Research and Development under grant No. SP/I/1/77065/10 by the strategic scientific research and experimental development program:
SYNAT - “Interdisciplinary System for Interactive Scientific and Scientific-Technical Information”.