摘要
给出了基于神经网络的单元归结算法.首先将子句集S表示为δ形,并且用算子对(⊙, )引入两种类型的神经元,然后用这两种神经元构造子句集S的神经网络结构,而后给出基于Horn子句集的神经网络的归结算法,最后证明了该算法的完备性,并用实例进行了验证.
In this paper, a unit resolution based on neural network is proposed. We first express a clause set S in σ-form and introduce two kinds of neurons by a couple of operator (⊙,). Then we use the two neurons to construct a neural network structure of clause set S, and give the resolution algorithm on NN for Horn clause set S. Finally, we prove the completeness of the algorithm based on this resolution and give a practical example to check the theory.
出处
《四川师范大学学报(自然科学版)》
CAS
CSCD
2004年第5期501-504,共4页
Journal of Sichuan Normal University(Natural Science)
关键词
归结
神经网络
Horn子句集
完备性
Resolution
Neural network
Horn clause set
Completeness theorem