  The automated proof search system and decidability for logic of correlated
knowledge is presented in this paper. The core of the proof system is the
sequent calculus with the properties of soundness, completeness, admissibility
of cut and structural rules, and invertibility of all rules. The proof search
procedure based on the sequent calculus performs automated terminating proof
search and allows us to achieve decision result for logic of correlated
knowledge.
