Extraction of common properties of objects for creation of a logic ontology

T. Kosovskaya, N. N. Kosovskii
{"title":"Extraction of common properties of objects for creation of a logic ontology","authors":"T. Kosovskaya, N. N. Kosovskii","doi":"10.21638/11701/spbu10.2022.103","DOIUrl":null,"url":null,"abstract":"The paper describes an approach to the formation of ontology based on descriptions of objects in terms of the predicate calculus language. With this approach, an object is represented as a set of its elements, on which a set of predicates is defined that defines the properties of these elements and the relationship between them. A description of an object is a conjunction of literals that are true on elements of an object. In the present work, ontology is understood as an oriented graph with descriptions of subsets as nodes and such that the elements of a set at the end of an oriented edge have the properties of the elements of the set at the beginning of this edge. Three settings of an ontology construction problem are considered: 1) all predicates are binary and subsets of the original set of objects are given; 2) all predicates are binary and it is required to find subsets of the original set; 3) among the predicates there are many-valued ones and subsets of the original set of objects are given. The main tool for construction such a description is to extract an elementary conjunction of literals of predicate formulas that is isomorphic to subformulas of some formulas. The definition of an isomorphism of elementary conjunctions of atomic predicate formulas is given. The method of ontology construction is formulated. An illustrative example is provided.","PeriodicalId":43738,"journal":{"name":"Vestnik Sankt-Peterburgskogo Universiteta Seriya 10 Prikladnaya Matematika Informatika Protsessy Upravleniya","volume":null,"pages":null},"PeriodicalIF":0.3000,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Vestnik Sankt-Peterburgskogo Universiteta Seriya 10 Prikladnaya Matematika Informatika Protsessy Upravleniya","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.21638/11701/spbu10.2022.103","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

The paper describes an approach to the formation of ontology based on descriptions of objects in terms of the predicate calculus language. With this approach, an object is represented as a set of its elements, on which a set of predicates is defined that defines the properties of these elements and the relationship between them. A description of an object is a conjunction of literals that are true on elements of an object. In the present work, ontology is understood as an oriented graph with descriptions of subsets as nodes and such that the elements of a set at the end of an oriented edge have the properties of the elements of the set at the beginning of this edge. Three settings of an ontology construction problem are considered: 1) all predicates are binary and subsets of the original set of objects are given; 2) all predicates are binary and it is required to find subsets of the original set; 3) among the predicates there are many-valued ones and subsets of the original set of objects are given. The main tool for construction such a description is to extract an elementary conjunction of literals of predicate formulas that is isomorphic to subformulas of some formulas. The definition of an isomorphism of elementary conjunctions of atomic predicate formulas is given. The method of ontology construction is formulated. An illustrative example is provided.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
为创建逻辑本体提取对象的公共属性
本文描述了一种基于谓词演算语言对对象的描述形成本体的方法。使用这种方法,对象被表示为它的一组元素,在这些元素上定义了一组谓词,这些谓词定义了这些元素的属性和它们之间的关系。对一个对象的描述是对一个对象的元素为真的字面量的结合。在目前的工作中,本体论被理解为一个有向图,其中子集的描述为节点,并且在有向边的末端的集合元素具有在该边的开始的集合元素的属性。考虑了本体构建问题的三种设置:1)所有谓词都是二元的,并且给出了原始对象集的子集;2)所有谓词都是二元的,需要找到原始集合的子集;3)谓语中存在多值谓语,并给出了原对象集的子集。构造这种描述的主要工具是提取与某些公式的子公式同构的谓词公式的文字的初等合取。给出了原子谓词公式的初等连词的同构的定义。提出了本体构建的方法。给出了一个说明性示例。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
1.30
自引率
50.00%
发文量
10
期刊介绍: The journal is the prime outlet for the findings of scientists from the Faculty of applied mathematics and control processes of St. Petersburg State University. It publishes original contributions in all areas of applied mathematics, computer science and control. Vestnik St. Petersburg University: Applied Mathematics. Computer Science. Control Processes features articles that cover the major areas of applied mathematics, computer science and control.
期刊最新文献
Beam dynamics simulation in the linear accelerator used as an injector for the 4th generation Specialized Synchrotron Radiation Source SSRS-4 Dynamic network model of production and investment Algorithm for optimal coloring of square (0,1)-matrices Sound synthesis approach based on the elastic stress analysis of a wrinkled thin film coating Method for solving an optimal control problem in the Mayer form with a quasidifferentiable functional in the presence of phase constraints
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1