描述逻辑系统UEVN中概念的包含关系  

Research on concept subsumption in description logic UEVN

作　　者：曹发生[1] 张维[2] 

机构地区：[1]毕节学院数学系逻辑、语言与认知研究中心,贵州毕节551700 [2]黔南民族师范学院数学系,贵州都匀558000

出　　处：《计算机工程与应用》2010年第30期43-45,共3页Computer Engineering and Applications

基　　金：贵州省教育厅自然科学基金资助项目(黔教科20090068,20090047);贵州省科学技术基金资助项目(黔科合J字[2009]2068号)

摘　　要：描述逻辑中的非标准推理是目前研究者们所关注的焦点问题,它主要包括:最具体概念、最小公共包含、匹配问题及概念的重写等。过去人们主要研究那些不含数量限制的描述逻辑系统,该文研究的是描述逻辑系统UEVN中的一种重要的非标准推理,它同时含有了并、存在约束量词、全称约束量词和数字限制。利用定义UEVN中概念的描述树及描述树之间的同态关系,给出了概念之间包含关系的充要条件。Nonstandard inference in description logic is a main issue that researchers are focusing on,it mainly includes the most specific concept,the least common subsumer,matching,rewriting and so on.Previous work mainly concerntrates on kinds of description logic systems which don＇t contain number restriction.This paper analyzes the least common subsumer in description logic UEVN which contains union,existential restriction,value restriction and number restriction at the same time.Firstly,the UEVN-concept description tree and the homomorphisms on description trees are defined,then the subsumption relationship is characterized between concepts by computing the homomorphisms between their description trees.

关 键 词：描述逻辑 非标准推理 概念描述树 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]