No confident code implementation found for this paper.
This research note provides algebraic characterizations of the least model, subsumption, and uniform equivalence of propositional Krom logic programs.
No confident code match yet
We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.
No code implementations found yet.
Know of an implementation? Let us know in the comments below!
Sequential decomposition of propositional logic programs
Graphical Conditions for the Existence, Unicity and Number of Regular Models
Representation Theorems for Cumulative Propositional Dependence Logics
Comparing Non-minimal Semantics for Disjunction in Answer Set Programming
Semirings for Probabilistic and Neuro-Symbolic Logic Programming
State Algebra for Propositional Logic
@article{anti2023algebraic,
title = {Algebraic characterizations of least model and uniform equivalence of propositional Krom logic programs},
author = {Christian Antić},
year = {2023},
eprint = {2302.04664},
archivePrefix = {arXiv},
url = {http://arxiv.org/abs/2302.04664v2}
}Shows whether official code is linked for this paper.
[](https://codeofpaper.com/paper/2302.04664)