{"title":"为创建逻辑本体提取对象的公共属性","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":"73 1","pages":""},"PeriodicalIF":0.3000,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"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\":\"73 1\",\"pages\":\"\"},\"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}","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}
Extraction of common properties of objects for creation of a logic ontology
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.
期刊介绍:
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.