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.

翻译：本文引入并研究了命题逻辑程序的顺序组合与分解。我们证明无环程序可分解为单规则程序，并给出了任意程序的通用分解结果。研究表明，程序的直接后果算子可通过组合表示，从而无需显式引用算子即可计算其最小模型。这以数学上令人满意的方式弥合了命题逻辑程序句法与语义之间的概念鸿沟。