归结策略的推理能力和复杂度

The inference-Ability of Some Incomplete Inference Strategies

为了对基于归结原理的各种归结策略进行性能分析,本文提出了推理能力和复杂度两个概念,并证明了:有序语义归结的推理能力强于单元归结;(2)有序线性归结的复杂度是指数级的。

In order to analyses the performance of the resolution-based inference strategies, the concept of inference-ability is proposed. For incomplete strategies, we have got the conclusion that the inference-ability of OI-resolution is stronger than that of the unit-resolution. For complete strate-gies, we demonstrated that the complexity of OL-resolution is exponential.