期刊文献+

EPCCL理论的并行知识编译算法 被引量:1

Parallel Knowledge Compilation Algorithms for EPCCL Theory
下载PDF
导出
摘要 基于超扩展规则,证明了EPCCL(Each Pair Contains Complementary Literal)理论的合并过程是可并行执行的,并设计了针对多个EPCCL理论的并行合并算法PUAE(Parallel computing Union of Any number of EPCCL).通过对EPCCL理论原始子句集的利用,提出了另一种高效的EPCCL理论并行合并算法imp-PUAE(improvement of PUAE).UKCHER(computing Union sets of maximum terms for Knowledge Compilation based on Hyper Extension Rule)是一种可并行的EPCCL理论编译算法,分别利用PUAE和imp-PUAE设计了两个并行知识编译算法P-UKCHER(UKCHER with PUAE)和imp P-UKCHER(UKCHER with imp-PUAE).实验结果表明:P-UKCHER算法虽然没有提升UKCHER算法的效率,但能够提升UKCHER算法编译结果的质量,最好情况下可提升4倍;而imp P-UKCHER算法能够提高UKCHER算法的效率,同时也能够提升编译结果的质量,同样最好情况下可提升4倍. Based on HER(hyper extension rule),we prove that the parallelization of merging multiple EPCCL(each pair contains complementary literal)is feasible,and the corresponding algorithm PUAE(parallel computing union of any number of EPCCL)is proposed.Through using the origin CNF formulae of EPCCL theories,another efficient merging algorithm imp-PUAE(improvement of PUAE)is proposed.UKCHER(computing union sets of maximum terms for knowledge compilation based on hyper extension rule)is a knowledge compilation algorithm for EPCCL,which can be parallelized.Based on the above methods,we proposed two parallel knowledge compilation algorithms i.e.,P-UKCHER(UKCHER with PUAE)and impP-UKCHER(UKCHER with imp-PUAE),which use the PUAE algorithm and imp-PUAE algorithm,respectively.Experimentally,although P-UKCHER does not improve the efficiency of UKCHER,the compilation quality is improved.In the best case,the compilation quality can be improved by 4 times with P-UKCHER.The impP-UKCHER can improve the efficiency and compilation quality of UKCHER at the same time,and the compilation quality can also be improved by 4 times in the best case.
作者 牛当当 刘磊 吕帅 NIU Dang-dang;LIU Lei;LüShuai(College of Computer Science and Technology,Jilin University,Changchun,Jilin 130012,China;Key Laboratory of Symbolic Computation and Knowledge Engineering(Jilin University),Ministry of Education,Changchun,Jilin 130012,China)
出处 《电子学报》 EI CAS CSCD 北大核心 2018年第3期537-543,共7页 Acta Electronica Sinica
基金 国家自然科学基金(No.61300049 No.61502197 No.61503044) 教育部高等学校博士学科点专项科研基金(No.20120061120059) 吉林省青年科研基金项目(No.20140520069JH No.20150520058JH) 吉林省自然科学基金项目(No.20150101054JC)
关键词 知识编译 扩展规则 超扩展规则 EPCCL理论 并行编译 knowledge compilation extension rule hyper extension rule EPCCL theory parallel compilation
  • 相关文献

参考文献8

二级参考文献93

  • 1WUXia SUNJigui LINHai FENGShasha.Modal extension rule[J].Progress in Natural Science:Materials International,2005,15(6):550-558. 被引量:7
  • 2Christoph W. SPASS-Version 0. 49[J]. Journal of Automated Reasoning, 1997, 18(2): 247-252. 被引量:1
  • 3Selman B, Kautz H. Knowledge compilation and theory approximation[J]. Journal of theACM, 1996, 43(2): 193- 224. 被引量:1
  • 4Cadoli M, Donini F M. A survey on knowledge compilation [J]. AICommunications, 1997, 10(3): 137-150. 被引量:1
  • 5Murray N V, Rosenthal E. Duality in knowledge compilation techniques [C] //LNCS 3488: Proc of the 15th Int Symp on Methodologies for Intelligent Systems. Berlin: Springer, 2005: 182-190. 被引量:1
  • 6Pipatsrisawat K, Darwiche A. New compilation languages based on structured decomposability [C] //Proe of the 23rd National Conf on Artificial Intelligence. Menlo Park, CA.- AAAI Press, 2008: 517-522. 被引量:1
  • 7Bryant R E. Symbolic Boolean manipulation with ordered binary decision diagrams [J]. ACM Computing Surveys, 1992, 24(3): 293- 318. 被引量:1
  • 8Marquis P. Knowledge compilation using theory prime implicates [C] //Proc of the 14th Int Joint Conf on Artificial Intelligence. San Francisco, CA: Morgan Kaufmann, 1995: 837-843. 被引量:1
  • 9Darwiche A. Decomposable negation normal form [J]. Journal of the ACM, 2001, 48(4): 608-647. 被引量:1
  • 10Hahnle R, Murray N V, Rosenthal E. Normal forms for knowledge compilation [G] //LNCS 3488.. Proe of the 15th Int Syrup on Methodologies for Intelligent Systems. Berlin: Springer, 2005:304-313. 被引量:1

共引文献26

同被引文献5

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部