论文标题
命题逻辑程序的顺序组成
Sequential composition of propositional logic programs
论文作者
论文摘要
本文介绍并研究了命题逻辑程序的顺序组成和分解。我们表明，无环程序可以分解为单条计划，并为任意程序提供一般的分解结果。我们表明，程序的直接后果运算符可以通过构图表示，这使我们能够计算其最小的模型，而无需明确的参考操作员。这弥合了命题逻辑程序的语法和语义之间的概念差距，以数学上令人满意的方式。
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.
