# Sequential composition of propositional logic programs

arXiv: https://arxiv.org/abs/2009.05774 · HTML: https://mlsanity.com/paper/2009.05774/

## Key facts

- Cited by 5 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 12 Sep 2020.

## Built on by (most cited first, 5 of 5)

- [Sequential composition of answer set programs](https://mlsanity.com/paper/2104.12156/) (2021)
- [Generalization-baed similarity](https://mlsanity.com/paper/2302.10096/) (2023)
- [Sequential decomposition of propositional logic programs](https://mlsanity.com/paper/2304.13522/) (2023)
- [Neural logic programs and neural nets](https://mlsanity.com/paper/2406.11888/) (2024)
- [The algebra of Krom logic programs](https://mlsanity.com/paper/2606.15719/) (2026)

## Abstract (arXiv)

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.