Sequential composition of propositional logic programs
Logic in Computer Science
2023-10-12 v7 Artificial Intelligence
Databases
Discrete Mathematics
Logic
Abstract
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.
Keywords
Cite
@article{arxiv.2009.05774,
title = {Sequential composition of propositional logic programs},
author = {Christian Antic},
journal= {arXiv preprint arXiv:2009.05774},
year = {2023}
}