Sequential decomposition of propositional logic programs

02/21/2023
by   Christian Antic, et al.
0

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
research
09/11/2021

On syntactically similar logic programs and sequential decompositions

Rule-based reasoning is an essential part of human intelligence prominen...
research
01/20/2023

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

This research note provides algebraic characterizations of equivalence w...
research
01/27/2021

Tutorial on implementing Hoare logic for imperative programs in Haskell

Using the programming language Haskell, we introduce an implementation o...
research
09/26/2018

Towards an Algebraic Theory of Analogical Reasoning in Logic Programming

Analogy-making is an essential part of human intelligence and creativity...
research
09/12/2020

Finite Horn Monoids via Propositional Horn Theory Composition

Describing complex objects as the composition of elementary ones is a co...
research
03/17/2022

Non-commutative propositional logic with short-circuited biconditional and NAND

Short-circuit evaluation denotes the semantics of propositional connecti...
research
02/06/2017

Exploring the bidimensional space: A dynamic logic point of view

We present a family of logics for reasoning about agents' positions and ...

Please sign up or login with your details

Forgot password? Click here to reset