中文摘要：

超扩展规则是对扩展规则的扩充,基于超扩展规则能够求得任意两个非互补且不相互蕴含的子句所能扩展出极大项集的交集与差集,并将所得结果以EPCCL理论的形式保存.该文首次提出了扩展反驳方法,是一种新型推理方法,并在该推理方法与知识编译之间建立了联系.基于超扩展规则的性质,该文还提出了两种知识编译算法：求并知识编译算法UKCHER和求差知识编译算法DKCHER,是两种新的知识编译算法.算法UKCHER是目前为止唯一一个可并行的EPCCL理论编译算法,算法DKCHER对于相变点附近的难解问题具有较高的编译效率和编译质量.实验结果表明：UKCHER算法的编译效率和编译质量均优于Lin等人提出的KCER算法;当子句数和变量数的比值较大时,DKCHER算法的编译效率和编译质量是最优的,相比于现有EPCCL理论编译算法,该算法具有较强的竞争力.

英文摘要：

Hyper extension rule is the expansion of extension rule.We can compute the union and difference set of two sets of maximum terms which are extended by two clauses respectively based on the hyper extension rule,and the results are saved as EPCCL theories.In this paper,we propose extension refutation,which is a novel reasoning method.A link between extension refutation and knowledge compilation is also established. We also introduce two knowledge compilation methods based on hyper extension rule：the algorithm UKCHER of computing the union set and the algorithm DKCHER of calculating the difference set,which are two novel knowledge compilation methods.UKCHER is the only one of the EPCCL compilers that can be parallelized,and the efficiency and quality of DKCHER are excellent for the difficult problems around phase transition point.Experimental results show that,the efficiency and quality of UKCHER are all superior to the algorithm KCER proposed by Lin et al.;when the ratio of the clause number and the variable number is bigger,the efficiency and quality of DKCHER is better.DKCHER has strong competitiveness comparing with other existing knowledge compilation algorithms of EPCCL theory.