归结原理是1965年由Robinson提出的一种重要的定理机器证明方法。1970年,Loveland和Luckham提出了线性归结,这是对归结原理的重要改进。一种特殊的线性归结——输入归结在计算机上极易实现。可惜,输入归结是不完备的。1974年Henschen和Wos研究了一种特殊子句集,即所谓Horn子句集。输入归结对于Horn集是完备的。1981年,陆汝铃对Horn集上的正单项有序归结和有序输入归结进行了研究,并得到很好的结果。 The principle of summary is an important theorem proved by Robinson in 1965. In 1970, Loveland and Luckham proposed a linear regression, which is an important improvement on the principle of reduction. A special linear regression - the input is very easy to implement on a computer. Unfortunately, the input is not complete. In 1974 Henschen and Wos studied a special clause set, the so-called Horn clause set. The input is complete for the Horn set. In 1981, Ruhrulen studied the positive and negative ordering of the Horn episodes and concluded that the orderly input was well-received.