On syntactically similar logic programs and sequential decompositions (2109.05300v3)
Abstract: Rule-based reasoning is an essential part of human intelligence prominently formalized in artificial intelligence research via logic programs. Describing complex objects as the composition of elementary ones is a common strategy in computer science and science in general. The author has recently introduced the sequential composition of logic programs in the context of logic-based analogical reasoning and learning in logic programming. Motivated by these applications, in this paper we construct a qualitative and algebraic notion of syntactic logic program similarity from sequential decompositions of programs. We then show how similarity can be used to answer queries across different domains via a one-step reduction. In a broader sense, this paper is a further step towards an algebraic theory of logic programming.
- 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.
- Antić, C. (2023). Logic program proportions. Annals of Mathematics and Artificial Intelligence, accepted. https://arxiv.org/pdf/1809.09938.pdf.
- Apt, K. R. (1990). Logic programming. In van Leeuwen, J. (Ed.), Handbook of Theoretical Computer Science, Vol. B, pp. 493–574. Elsevier, Amsterdam.
- Apt, K. R. (1997). From Logic Programming to Prolog. C.A.R. Hoare Series. Prentice Hall, Prentice Hall, Englewood Cliffs, NJ.
- Baral, C. (2003). Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, Cambridge.
- Compositional model-theoretic semantics for logic programs. New Generation Computing, 11, 1–21.
- Modularity in logic programming. The Journal of Logic Programming, 19-20(1), 443–502.
- On the decomposition of datalog program mappings. Theoretical Computer Science, 76(1), 143–177.
- On decompositions of chain datalog programs into 𝒫𝒫\mathcal{P}caligraphic_P (left-)linear 1-rule components. The Journal of Logic Programming, 23(3), 203–236.
- Towards an algebraic theory of recursion. Journal of the ACM, 38(2), 329–381.
- Lloyd, J. W. (1987). Foundations of Logic Programming (2 edition). Springer-Verlag, Berlin, Heidelberg.
- O’Keefe, R. A. (1985). Towards an algebra for constructing logic programs. In SLP 1985, pp. 152–160.
- Plambeck, T. (1990). Semigroup techniques in recursive query optimization. In PODS 1990, pp. 145–153.
- Analogical reasoning for logic programming. In Kodratoff, Y. (Ed.), EWSL 1991, LNCS 482, pp. 391–397. Springer-Verlag, Berlin/Heidelberg.
- Christian Antic (2 papers)