Sequential decomposition of propositional logic programs
The sequential composition of propositional logic programs has been recently introduced. This paper studies the sequential decomposition of programs by studying Green's relations ℒ,ℛ,𝒥 – well-known in semigroup theory – between programs. In a broader sense, this paper is a further step towards an algebraic theory of logic programming.
READ FULL TEXT