New reasoning algorithm based on EFALC  

一个新的基于EFALC的推理算法(英文)

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

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

出　　处：《Journal of Southeast University(English Edition)》2006年第4期496-500,共5页东南大学学报（英文版）

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

摘　　要：The current extended fuzzy description logics lack reasoning algorithms with TBoxes. The problem of the satisfiability of the extended fuzzy description logic EFALC cut concepts w. r. t. TBoxes is proposed, and a reasoning algorithm is given. This algorithm is designed in the style of tableau algorithms, which is usually used in classical description logics. The transformation rules and the process of this algorithm is described and optimized with three main techniques： recursive procedure call, branch cutting and introducing sets of mesne results. The optimized algorithm is proved sound, complete and with an EXPTime complexity, and the satisfiability problem is EXPTime-complete.针对目前的扩展模糊描述逻辑缺乏TBox约束下的推理算法,提出TBox约束下扩展模糊描述逻辑EFALC截概念可满足性问题及其推理算法.该算法的设计参考用于经典描述逻辑的tab-leau算法;详细描述了EFALC的转化规则和推理算法的过程,并使用递归函数调用、分支裁减和引入中间结果集合这3种技术对算法进行优化.证明了该优化推理算法的最坏时间复杂性为指数,且具有完备性和正确性,同时证明了TBox约束下EFALC截概念可满足性问题的复杂性是指数时间完全的.

关 键 词：extended fuzzy description logic cut concept TBox reasoning algorithm 

分 类 号：TP311.13[自动化与计算机技术—计算机软件与理论]