gfp-model-based reasoning of terminological cycles in description logic FLε

doi:10.3778/j.issn.1002-8331.2010.12.009

Computer Engineering and Applications ›› 2010, Vol. 46 ›› Issue (12): 32-37.DOI: 10.3778/j.issn.1002-8331.2010.12.009

• 研究、探讨 • Previous Articles Next Articles

gfp-model-based reasoning of terminological cycles in description logic FLε

QIN Jun-ming¹，GENG Ji-bing¹，WANG Ju²，JIANG Yun-cheng^2，3

1.College of Mathematics Science，Guangxi Normal University，Guilin，Guangxi 541004，China
2.College of Computer Science and Information Engineering，Guangxi Normal University，Guilin，Guangxi 541004，China
3.State Key Laboratory of Computer Science，Chinese Academy of Sciences，Beijing 100190，China

Received:2009-09-28 Revised:2009-11-13 Online:2010-04-21 Published:2010-04-21
Contact: QIN Jun-ming

gfp-模型的描述逻辑FLε的循环术语集推理

覃俊明¹，耿继兵¹，王驹²，蒋运承^2，3

1.广西师范大学数学科学学院，广西桂林 541004
2.广西师范大学计算机科学与信息工程学院，广西桂林 541004
3.中国科学院计算机科学国家重点实验室，北京 100190

通讯作者: 覃俊明

Abstract

Abstract:

Description Logic（DL） is a family of knowledge representation formalisms and a hotpoint research direction of artificial intelligence.Description logic systems with cycle definition are more accord with people’s intuition，with stronger expression ability and can not be replaced by other description logics in non-cycle definition.This article first presents the semantics and syntax of the description logic system FLε，also gives a proof of the theorem on existence of greatest fixpoint model.Based on the greatest fixpoint semantics，it discusses algorithms for reasoning about the subsumption in cyclic terminological Tbox of the description logic system FLε which has existential and value restrictions.

摘要： 描述逻辑（DL）一族知识表示形式系统，是人工智能领域的一个热门研究方向。循环定义下描述逻辑系统的表达在许多情况下更符合人们的直觉，而且具有更强的表达力，是非循环定义下的描述逻辑系统不可代替的。首先给出描述逻辑系统FLε有最大不动点模型的证明，然后初步探讨基于最大不动点语义下描述逻辑系统FLε循环定义的包含关系推理算法，并给出算法的可靠性和完全性证明。

CLC Number:

TP301

QIN Jun-ming¹，GENG Ji-bing¹，WANG Ju²，JIANG Yun-cheng^2，3. gfp-model-based reasoning of terminological cycles in description logic FLε[J]. Computer Engineering and Applications, 2010, 46(12): 32-37.

覃俊明¹，耿继兵¹，王驹²，蒋运承^2，3. gfp-模型的描述逻辑FLε的循环术语集推理[J]. 计算机工程与应用, 2010, 46(12): 32-37.

[1]	GAO Fang1，2，HAN Pu1，ZHAI Yongjie1. Ant colony algorithm with mutation operation for continuous function optimization [J]. Computer Engineering and Applications, 2011, 47(4): 5-8.
[2]	ZHAO Dongxu，YUE Xiaobo. Optimizing parameters of fuzzy Petri net based on improved evolutionary strategy [J]. Computer Engineering and Applications, 2011, 47(4): 29-32.
[3]	SONG Xiaozhen^1，2，HAN Zhaowei¹，LI Yongming³. Algebraic properties of context-free grammar based on quantum logic [J]. Computer Engineering and Applications, 2011, 47(4): 42-46.
[4]	HUANG Minmei. Particle swarm optimization based method for logistics center location problem [J]. Computer Engineering and Applications, 2011, 47(4): 212-214.
[5]	DANG Zhengjun，DU Zhongjun. Improved algorithm combining graph-reduction and graph-search for workflow verification [J]. Computer Engineering and Applications, 2011, 47(4): 226-228.
[6]	LIU Jun^1，2，XIONG Zhongyang¹，WANG Yinhui¹. Application of improved dynamic tunneling neural network in protein secondary structure prediction [J]. Computer Engineering and Applications, 2011, 47(3): 13-16.
[7]	LIU Qiongsun，FAN Ruiya. Method of determining Gaussian kernel parameter by clustering [J]. Computer Engineering and Applications, 2011, 47(3): 38-40.
[8]	HAN Zhaowei^1，2，HAN Zhaoying³. Algebraic characterizations of context-free languages based on Lukasiewicz logic [J]. Computer Engineering and Applications, 2011, 47(3): 47-50.
[9]	DAI Haipeng，TANG Houjun. Improved algorithm for computing diameter of convex polygons [J]. Computer Engineering and Applications, 2011, 47(3): 44-46.
[10]	LI Qiang，LIU Guodong. Planning method for multiple mobile robots form team [J]. Computer Engineering and Applications, 2011, 47(2): 242-245.
[11]	CHEN Yingxian. Ant colony based on fuzzy set of spatial clustering [J]. Computer Engineering and Applications, 2011, 47(2): 5-7.
[12]	CUI Mingyi. Research on denoising mutation of FPRGA based on wavelet decomposition [J]. Computer Engineering and Applications, 2011, 47(2): 35-37.
[13]	YU Yong¹，ZHANG Ya²，GUO Xijuan²，FENG Xue². Decomposing non-convex polyhedron based on successful loop [J]. Computer Engineering and Applications, 2011, 47(2): 41-42.
[14]	WANG Bao，SUN Qin. Parallel algorithm for solving nonlinear system of equations [J]. Computer Engineering and Applications, 2011, 47(2): 49-51.
[15]	LIN Shilai，LIU Guangyuan，ZHANG Huiling. Application of ACO algorithm to emotion recognition research based on RSP signal [J]. Computer Engineering and Applications, 2011, 47(2): 169-172.

gfp-model-based reasoning of terminological cycles in description logic FLε

gfp-模型的描述逻辑FLε的循环术语集推理

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 15

Recommended Articles

Metrics