Reasoning complexity for extended fuzzy description logic with qualifying number restriction  

限制数量约束的扩展模糊描述逻辑的推理复杂性(英文)

作　　者：陆建江[1] 李言辉[2] 张亚非[1] 周波[1] 康达周[2] 

机构地区：[1]解放军理工大学指挥自动化学院,南京210007 [2]东南大学计算机科学与工程学院,南京210096

出　　处：《Journal of Southeast University(English Edition)》2007年第2期236-240,共5页东南大学学报（英文版）

基　　金：The National Natural Science Foundation of China(No60403016);the Weaponry Equipment Foundation of PLA Equip-ment Ministry (No51406020105JB8103)

摘　　要：To solve the extended fuzzy description logic with qualifying number restriction （EFALCQ） reasoning problems, EFALCQ is discretely simulated by description logic with qualifying number restriction （ALCQ）, and ALCQ reasoning results are reused to prove the complexity of EFALCQ reasoning problems. The ALCQ simulation method for the consistency of EFALCQ is proposed. This method reduces EFALCQ satisfiability into EFALCQ consistency, and uses EFALCQ satisfiability to discretely simulate EFALCQ satdomain. It is proved that the reasoning complexity for EFALCQ satisfiability, consistency and sat-domain is PSPACE-complete.为了解决限制数量约束的扩展模糊描述逻辑(EFALCQ)的推理复杂性问题,采用限制数量约束的描述逻辑(ALCQ)离散模拟EFALCQ,并重用ALCQ的推理结论来证明EFALCQ推理问题的复杂性.提出了EFALCQ一致性推理问题的ALCQ模拟方法,将EFALCQ的可满足性推理问题转换为EFALCQ的一致性推理问题,并用EFALCQ的一致性推理问题离散模拟EFALCQ的可满足区间推理问题.最后证明了EFALCQ的可满足性、一致性、以及可满足区间推理问题的推理复杂性是PSPACE-complete问题.

关 键 词：extended fuzzy description logic qualifying number restriction reasoning complexity 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]