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

This work addresses foundational issues in logic programming for researchers in computational logic, but it appears incremental as it builds on existing equivalence concepts.

The paper tackled the problem of characterizing equivalence relations in propositional Krom logic programs, providing algebraic characterizations for least model, subsumption, and uniform equivalence.