Sequential decomposition of propositional logic programs
Abstract
The sequential composition of propositional logic programs has been recently introduced. This paper studies the sequential decomposition of programs by studying Green's relations 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.