具有不可折叠术语的描述逻辑EL的相似性度量

B. Suntisrivaraporn
{"title":"具有不可折叠术语的描述逻辑EL的相似性度量","authors":"B. Suntisrivaraporn","doi":"10.1109/INCoS.2013.77","DOIUrl":null,"url":null,"abstract":"Description Logics (DLs) are a family of logic-based knowledge representation formalisms, which can be used to develop ontologies in a formally well-founded way. The standard reasoning service of subsumption has proved indispensable in ontology design and maintenance. This checks, relative to the logical definitions in the ontology, whether one concept is more general/specific than another. When no subsumption relationship is identified, however, no information about the two concepts can be given. This work presents a new notion of semantic similarity which stems from the known homomorphism-based structural subsumption algorithm. The proposed similarity measure computes a numerical degree of similarity between two EL concept descriptions despite not being in the subsumption relation.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"23","resultStr":"{\"title\":\"A Similarity Measure for the Description Logic EL with Unfoldable Terminologies\",\"authors\":\"B. Suntisrivaraporn\",\"doi\":\"10.1109/INCoS.2013.77\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Description Logics (DLs) are a family of logic-based knowledge representation formalisms, which can be used to develop ontologies in a formally well-founded way. The standard reasoning service of subsumption has proved indispensable in ontology design and maintenance. This checks, relative to the logical definitions in the ontology, whether one concept is more general/specific than another. When no subsumption relationship is identified, however, no information about the two concepts can be given. This work presents a new notion of semantic similarity which stems from the known homomorphism-based structural subsumption algorithm. The proposed similarity measure computes a numerical degree of similarity between two EL concept descriptions despite not being in the subsumption relation.\",\"PeriodicalId\":353706,\"journal\":{\"name\":\"2013 5th International Conference on Intelligent Networking and Collaborative Systems\",\"volume\":\"28 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-09-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"23\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 5th International Conference on Intelligent Networking and Collaborative Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INCoS.2013.77\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INCoS.2013.77","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 23

摘要

描述逻辑(dl)是一系列基于逻辑的知识表示形式,可用于以形式良好的方式开发本体。包容的标准推理服务在本体的设计和维护中是不可或缺的。这将检查相对于本体中的逻辑定义,一个概念是否比另一个概念更一般/特定。但是,当没有确定包含关系时,就不能给出关于这两个概念的信息。这项工作提出了一种新的语义相似性概念,它源于已知的基于同态的结构包容算法。所提出的相似性度量计算两个EL概念描述之间的数值相似性程度,尽管不处于包容关系中。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Similarity Measure for the Description Logic EL with Unfoldable Terminologies
Description Logics (DLs) are a family of logic-based knowledge representation formalisms, which can be used to develop ontologies in a formally well-founded way. The standard reasoning service of subsumption has proved indispensable in ontology design and maintenance. This checks, relative to the logical definitions in the ontology, whether one concept is more general/specific than another. When no subsumption relationship is identified, however, no information about the two concepts can be given. This work presents a new notion of semantic similarity which stems from the known homomorphism-based structural subsumption algorithm. The proposed similarity measure computes a numerical degree of similarity between two EL concept descriptions despite not being in the subsumption relation.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信