On finite relation equations with sup-conjunctor composition over a complete lattice

This work studies the problem of solving a sup-T composite finite relation equation over a complete lattice L, where T is a conjunctor. A criterion for the equation to have a solution is given. An algorithm for finding the solution set of the equation is presented.