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.

翻译：基于规则的推理是人类智能的重要组成部分，在人工智能研究中通过逻辑程序得到了形式化体现。将复杂对象描述为基本元素的组合是计算机科学乃至整个科学领域的常见策略。作者近期在基于逻辑的类比推理与逻辑程序设计学习背景下，引入了逻辑程序的序列组合概念。受这些应用启发，本文从程序的序列分解出发，构建了逻辑程序句法相似性的定性代数学概念，进而展示如何通过单步归约利用这种相似性来回答跨领域查询。从更广泛的意义上讲，本文是对逻辑程序设计代数学理论的进一步推进。