论文标题
存在量化方程系统作为逻辑编程中答案的隐式表示
Existentially Quantified Systems of Equations as an Implicit Representation of Answers in Logic Programming
论文作者
论文摘要
在本文中，我们提出了一种正式化逻辑编程理论的替代方法。在此形式化中，我们允许查询存在量化的变量和方程。与标准方法相反，答案的作用将由存在的方程式系统扮演。这使我们在处理替换时可以避免问题。特别是，当输入子句引入新变量时，我们无需“全局”变量分离条件。此外，这种形式化可以视为并发逻辑语言理论的基础，因为它还包括广泛的平行计算方法。此外，可以将答案的并行组成直接定义 - 作为答案的一致结合。
In this paper we present an alternative approach to formalize the theory of logic programming. In this formalization we allow existential quantified variables and equations in queries. In opposite to standard approaches the role of answer will be played by existentially quantified systems of equations. This allows us to avoid problems when we deal with substitutions. In particular, we need no ''global'' variable separated conditions when new variables are introduced by input clauses. Moreover, this formalization can be regarded as a basis for the theory of concurrent logic languages, since it also includes a wide spectrum of parallel computational methods. Moreover, the parallel composition of answers can be defined directly -- as a consistent conjunction of answers.
