可能性扩展规则的推理和知识编译

在扩展规则的基础上提出了可能性扩展规则。给出了基于可能性扩展规则的可能性逻辑推理方法，利用互补因子的概念来估价推理问题的复杂度。扩展了经典逻辑的蕴含可控制类和可满足可控制类的定义，提出了可能性蕴含可控制类、不一致性程度计算可控制类的概念。在可能性扩展规则的基础上提出了EPPCCCL(each pair of possibilistic clauses contains complementary literals)理论，并证明了该理论是在最优化形式蕴含可控制类和不一致性程度计算可控制类中的，可以作为可能性

Possibilistic Extension Rules for Reasoning and Knowledge Compilation

First, the possibilistic extension, a possible manifestation of the extention rule, is proposed. A reasoning mechanic in possibilistic logic, using the possibilistic extension rule, is then introduced, using the concept of the complementary factor to estimate its complexity. The definitions of entailment tractable and satisfiability tractable are extended to introduce the concepts of possibilistic entailment tractable and consistent-computing tractable. Based on possibilistic extension rules, EPPCCCL (each pair of possibilistic clauses contains complementary literals) theory is introduced, which is proved to be possibilistic entailment tractable and consistent-computing tractable; therefore, the theory can be regarded as a target language of possibilistic knowledge compilation.