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,R,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.

翻译：近年来，命题逻辑程序的序贯组合已被引入。本文通过研究程序间的Green关系$\mathcal{L,R,J}$（半群理论中广为人知的关系），探讨程序的序贯分解。广义而言，本文是迈向逻辑编程代数理论的又一重要步骤。