CAJ | 학술논문

针对目前的扩展模糊描述逻辑缺乏TBox约束下的推理算法,提出TBox约束下扩展模糊描述逻辑EFALC截概念可满足性问题及其推理算法.该算法的设计参考用于经典描述逻辑的tableau算法;详细描述了EFALC的转化规则和推理算法的过程,并使用递归函数调用、分支裁减和引入中间结果集合这3种技术对算法进行优化.证明了该优化推理算法的最坏时间复杂性为指数,且具有完备性和正确性,同时证明了TBox约束下EFALC截概念可满足性问题的复杂性是指数时间完全的.
침대목전적확전모호묘술라집결핍TBox약속하적추리산법,제출TBox약속하확전모호묘술라집EFALC절개념가만족성문제급기추리산법.해산법적설계삼고용우경전묘술라집적tableau산법;상세묘술료EFALC적전화규칙화추리산법적과정,병사용체귀함수조용、분지재감화인입중간결과집합저3충기술대산법진행우화.증명료해우화추리산법적최배시간복잡성위지수,차구유완비성화정학성,동시증명료TBox약속하EFALC절개념가만족성문제적복잡성시지수시간완전적.
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.