This paper introduces and studies the sequential composition and decomposition of propositional logic programs. We show that acyclic programs can be decomposed into single-rule programs and provide a general decomposition result for arbitrary programs. We show that the immediate consequence operator of a program can be represented via composition which allows us to compute its least model without any explicit reference to operators. This bridges the conceptual gap between the syntax and semantics of a propositional logic program in a mathematically satisfactory way.

中文翻译：

---

命题逻辑程序的顺序组合

本文介绍并研究了命题逻辑程序的顺序合成和分解。我们证明非循环程序可以分解为单规则程序，并为任意程序提供通用分解结果。我们证明了程序的直接结果运算符可以通过组合来表示，这允许我们计算其最小模型而无需任何对运算符的显式引用。这以数学上令人满意的方式弥合了命题逻辑程序的语法和语义之间的概念差距。