2000 character limit reached
Algebraic characterizations of least model and uniform equivalence of propositional Krom logic programs (2302.04664v2)
Published 20 Jan 2023 in cs.LO and cs.AI
Abstract: This research note provides algebraic characterizations of the least model, subsumption, and uniform equivalence of propositional Krom logic programs.
- Antić, C. (2020). Sequential composition of propositional logic programs. https://arxiv.org/pdf/2009.05774.pdf.
- Antić, C. (2021). Sequential composition of answer set programs. https://arxiv.org/pdf/2104.12156.pdf.
- Clark, K. L. (1978). Negation as failure. In Gallaire, H., and Minker, J. (Eds.), Logic and Data Bases, pp. 293–322. Plenum Press, New York.
- Uniform equivalence of logic programs under the stable model semantics. In ICLP 2003, LNCS 2916, pp. 224–238. Springer-Verlag.
- Krom, M. R. (1967). The decision problem for a class of first-order formulas in which all disjunctions are binary. Mathematical Logic Quarterly, 13(1-2), 15–20.
- Maher, M. J. (1988). Equivalences of logic programs. In Minker, J. (Ed.), Foundations of Deductive Databases and Logic Programming, chap. 16, pp. 627–658. Morgan Kaufmann Publishers.
- Sagiv, Y. (1988). Optimizing datalog programs. In Minker, J. (Ed.), Foundations of Deductive Databases and Logic Programming, chap. 17, pp. 659–698. Morgan Kaufmann Publishers.