Information, mereology and vagueness

IF 2.5 4区 计算机科学 Q3 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Applied Ontology Pub Date : 2023-03-22 DOI:10.3233/ao-230277
Thomas Bittner
{"title":"Information, mereology and vagueness","authors":"Thomas Bittner","doi":"10.3233/ao-230277","DOIUrl":null,"url":null,"abstract":"Classical systems of mereology identify a maximuml set of jointly exhaustive and pairwise disjoint (RCC5) relations. The amount of information that is carried by each member of this set of (crisp) relations is determined by the number of bits of information that are required to distinguish all the members of the set. It is postulated in this paper, that vague mereological relations are limited in the amount of information they can carry. That is, if a crisp mereological relation can carry N bits of information, then a vague mereological relation can carry only 1 ⩽ n < N bits. The aim of this paper is it to explore these ideas in the context of various systems of vague mereological relations. The resulting formalism is non-classical in the sense of quantum information theory.","PeriodicalId":49238,"journal":{"name":"Applied Ontology","volume":"18 1","pages":"119-167"},"PeriodicalIF":2.5000,"publicationDate":"2023-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Ontology","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.3233/ao-230277","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Classical systems of mereology identify a maximuml set of jointly exhaustive and pairwise disjoint (RCC5) relations. The amount of information that is carried by each member of this set of (crisp) relations is determined by the number of bits of information that are required to distinguish all the members of the set. It is postulated in this paper, that vague mereological relations are limited in the amount of information they can carry. That is, if a crisp mereological relation can carry N bits of information, then a vague mereological relation can carry only 1 ⩽ n < N bits. The aim of this paper is it to explore these ideas in the context of various systems of vague mereological relations. The resulting formalism is non-classical in the sense of quantum information theory.
信息、流变和模糊性
经典气象学系统确定了一个联合穷尽和成对不相交(RCC5)关系的最大集合。这组(清晰的)关系的每个成员所携带的信息量是由区分集合中所有成员所需的信息位数决定的。本文假定,模糊的流变关系所能承载的信息量是有限的。也就是说,如果一个清晰的流变关系可以携带N比特的信息,那么一个模糊的流变关系只能携带1≤N < N比特的信息。本文的目的是在各种模糊气象关系系统的背景下探讨这些思想。由此产生的形式主义在量子信息理论的意义上是非经典的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Applied Ontology
Applied Ontology COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE-COMPUTER SCIENCE, INFORMATION SYSTEMS
CiteScore
4.80
自引率
30.00%
发文量
15
审稿时长
>12 weeks
期刊介绍: Applied Ontology focuses on information content in its broadest sense. As the subtitle makes clear, two broad kinds of content-based research activities are envisioned: ontological analysis and conceptual modeling. The former includes any attempt to investigate the nature and structure of a domain of interest using rigorous philosophical or logical tools; the latter concerns the cognitive and linguistic structures we use to model the world, as well as the various analysis tools and methodologies we adopt for producing useful computational models, such as information systems schemes or knowledge structures. Applied Ontology is the first journal with explicit and exclusive focus on ontological analysis and conceptual modeling under an interdisciplinary view. It aims to establish a unique niche in the realm of scientific journals by carefully avoiding unnecessary duplication with discipline-oriented journals. For this reason, authors will be encouraged to use language that will be intelligible also to those outside their specific sector of expertise, and the review process will be tailored to this end. For example, authors of theoretical contributions will be encouraged to show the relevance of their theory for applications, while authors of more technological papers will be encouraged to show the relevance of a well-founded theoretical perspective. Moreover, the journal will publish papers focusing on representation languages or algorithms only where these address relevant content issues, whether at the level of practical application or of theoretical understanding. Similarly, it will publish descriptions of tools or implemented systems only where a contribution to the practice of ontological analysis and conceptual modeling is clearly established.
×
引用
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学术官方微信