Reduction relations for monoidsemirings

In this paper we study rewriting techniques for monoidsemirings. Based on disjoint and non-disjoint representations of the elements of monoidsemirings we define two different reduction relations. We prove that in both cases the reduction relation describes the congruence that is induced by the underlying set of equations, and we study the termination and confluence properties of the reduction relations.