逻辑程序设计中作为答案隐式表示的量子化方程组
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
