Sequential decomposition of propositional logic programs

The sequential composition of propositional logic programs has been recently introduced. This paper studies the sequential {\em decomposition} of programs by studying Green’s relations $\mathcal{L},\mathcal{R},\mathcal{J}$ – well-known in semigroup theory – between programs. In a broader sense, this paper is a further step towards an algebraic theory of logic programming.