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

01/20/2023
by   Christian Antic, et al.
0

This research note provides algebraic characterizations of equivalence with respect to the least model semantics, and of uniform equivalence of propositional Krom logic programs.

READ FULL TEXT
research
02/21/2023

Sequential decomposition of propositional logic programs

The sequential composition of propositional logic programs has been rece...
research
06/11/2009

Characterising equilibrium logic and nested logic programs: Reductions and complexity

Equilibrium logic is an approach to nonmonotonic reasoning that extends ...
research
12/04/2011

Strong Equivalence of Qualitative Optimization Problems

We introduce the framework of qualitative optimization problems (or, sim...
research
07/08/2022

Partition refinement for emulation

Kripke models are useful to express static knowledge or belief. On the o...
research
08/06/1999

Extending the Stable Model Semantics with More Expressive Rules

The rules associated with propositional logic programs and the stable mo...
research
08/08/2021

Planning for an Efficient Implementation of Hypothetical Bousi Prolog

This paper explores the integration of hypothetical reasoning into an ef...
research
08/06/2020

Incremental maintenance of overgrounded logic programs with tailored simplifications

The repeated execution of reasoning tasks is desirable in many applicati...

Please sign up or login with your details

Forgot password? Click here to reset