Systems of inclusions with unknowns in multioperations

We consider systems of inclusions with unknowns and coefficients in multioperations of finite rank. An algorithm for solving such systems by the method of reduction to Boolean equations using superposition representation of multioperations by Boolean space matrices is given. Two methods for solving Boolean equations with many unknowns are described for completeness. The presentation is demonstrated by examples: the representation of the superposition of multioperations by Boolean space matrices; solving a Boolean equation by analytical and numerical methods; and finding solutions to an inclusion with one unknown. The resulting algorithm can be applied to the development of logical inference systems for multioperator logics.