首页|Complementary Knowledge Compilation Using the Hyper Extension Rule

Complementary Knowledge Compilation Using the Hyper Extension Rule

扫码查看
原文链接
  • NETL
  • NSTL
  • 万方数据
  • 维普
We introduce the concept of Complemen-tary formula (COMF), which is a new and non-equivalent way for Knowledge compilation (KC). Based on the Hyper extension rule (HER) which is an expansion of Extension rule (ER), we design a compilation algorithm which can formula compile each Conjunctive normal form (CNF) formula to complementary Fully complementary connected diagram (c-FCCD), named as C2C (CNF formula to c-FCCD). Theoretically, c-FCCD is a kind of complementary formulae of the input formulae and can support all queries and partial transformations in KC map. Experimentally, C2C is competitive with the EPCCL compilers KCER, C2E, UKCHER, DKCHER and IKCHER.

Knowledge compilationExtension ruleHyper extension ruleCompilation languageEach pair contains complementary literals (EPCCL) theory

NIU Dangdang、LIU Lei、LYU Shuai、XU Yue

展开 >

College of Computer Science and Technology, Jilin University, Changchun 130012, China

Key Laboratory of Symbolic Computation and Knowledge Engineering, Ministry of Education, Jilin University, Changchun 130012, China

This work is supported by the National Natural Science Foundation of ChinaThis work is supported by the National Natural Science Foundation of ChinaThis work is supported by the National Natural Science Foundation of ChinaThis work is supported by the National Natural Science Foundation of ChinaNatural Science Research Foundation of Jilin Province of China

61300049No.61502197No.61503044No.6176300320180101053JC

2019

10.1049/cje.2018.06.009

中国电子杂志(英文版)

中国电子杂志(英文版)

CSTPCDCSCDSCIEI
ISSN：1022-4653
年,卷(期)：2019.28(2)
  • 14