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

TL;DR

This paper offers algebraic characterizations of key concepts like least model, subsumption, and uniform equivalence specifically for propositional Krom logic programs, enhancing theoretical understanding.

Contribution

It introduces novel algebraic characterizations for the least model and uniform equivalence in propositional Krom logic programs, filling a gap in formal semantics.

Findings

Algebraic characterization of least model

Algebraic criteria for uniform equivalence

Enhanced understanding of propositional Krom logic programs

Abstract

This research note provides algebraic characterizations of the least model, subsumption, and uniform equivalence of propositional Krom logic programs.