β-PSML中混合推理算法的正确性证明

摘要

Based on the existential entailment algorithm proposed, this paper proves the correctness of the existential entailment algorithm by combining production rules. The algorithm provides a sound and complete inference procedure for nonrecursive β-PSML knowledge base in which the description logic component is confirmable.%根据已经给出的β-PSML中的混合推理算法，通过结合产生规则，给出了β-PSML中混合推理算法的正确性证明及其复杂性分析．结果表明，在描述逻辑是可确定的情况下，无递归的β-PSML知识库可以提供一个正确和完备的推理算法。