Sequential decomposition of propositional logic programs

Christian Antić
2/21/2023
cs.LOcs.AI

No confident code implementation found for this paper.

Abstract

The sequential composition of propositional logic programs has been recently introduced. This paper studies the sequential {\em decomposition} of programs by studying Green's relations $\mathcal{L,R,J}$ -- well-known in semigroup theory -- between programs. In a broader sense, this paper is a further step towards an algebraic theory of logic programming.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Algebraic characterizations of least model and uniform equivalence of propositional Krom logic programs

78% match2023

Semirings for Probabilistic and Neuro-Symbolic Logic Programming

76% match2024

A separation logic for sequences in pointer programs and its decidability

76% match2023

Representation Theorems for Cumulative Propositional Dependence Logics

75% match2026

A novel framework for systematic propositional formula simplification based on existential graphs

75% match2024

State Algebra for Propositional Logic

75% match2025

Cite this paper

@article{anti2023sequential,
  title  = {Sequential decomposition of propositional logic programs},
  author = {Christian Antić},
  year   = {2023},
  eprint = {2304.13522},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2304.13522v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2304.13522.svg)](https://codeofpaper.com/paper/2304.13522)

Discussion