Towards a New Massively Parallel Computational Model for Logic Programming
Towards a New Massively Parallel Computational Model for Logic Programming
复制标题
DOI：
--
复制
发表时间：
1994
期刊：
影响因子：
--
通讯作者：
Steffen Hölldobler;Y. Kalinke
中科院分区：
文献类型：
--
作者：
Steffen Hölldobler;Y. Kalinke
逻辑程序的语义通常被理解为一个适当的意义运算符的最小杂化点。然而，在正常程序的情况下，确实会出现一些不期望的结果，最近有人建议应用度量方法来克服这些问题。我们在本文中表明，这些度量方法可以通过循环连接网络直接实现，从而产生一种新的逻辑编程的大规模并行计算模型。
The semantics of logic programs is commonly deened as the least xed point of an appropriate meaning operator. In case of normal programs, however, some undesired results do occur and it has recently been suggested to apply metric methods in order to overcome these problems. We show in this paper that these metric methods can be directly implemented by recurrent connectionist networks giving rise to a new massively parallel computational model for logic programming.