Sequential composition of propositional logic programs
This provides a mathematically satisfactory bridge between syntax and semantics for propositional logic programs, which is incremental theoretical work in logic programming.
The paper tackles the problem of connecting syntax and semantics in propositional logic programs by introducing sequential composition and decomposition, showing that acyclic programs can be decomposed into single-rule programs and that the immediate consequence operator can be represented via composition to compute the least model without explicit operators.
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.