Пожалуйста, используйте этот идентификатор, чтобы цитировать или ссылаться на этот ресурс:
http://hdl.handle.net/11701/36930
Полная запись метаданных
Поле DC | Значение | Язык |
---|---|---|
dc.contributor.author | Kosovskaya, Tatiana M. | - |
dc.contributor.author | Kosovskii, Nikolai N. | - |
dc.date.accessioned | 2022-06-23T13:13:51Z | - |
dc.date.available | 2022-06-23T13:13:51Z | - |
dc.date.issued | 2022-03 | - |
dc.identifier.citation | Kosovskaya T. M., Kosovskii N. N. Extraction of common properties of objects for creation of a logic ontology. Vestnik of Saint Petersburg University. Applied Mathematics. Computer Science. Control Processes, 2022, vol. 18, iss. 1, pp. 37–51. | en_GB |
dc.identifier.other | https://doi.org/10.21638/11701/spbu10.2022.103 | - |
dc.identifier.uri | http://hdl.handle.net/11701/36930 | - |
dc.description.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. | en_GB |
dc.description.sponsorship | This work was carried out with the financial support of St Petersburg State University (project N 73555239). | en_GB |
dc.language.iso | ru | en_GB |
dc.publisher | St Petersburg State University | en_GB |
dc.relation.ispartofseries | Vestnik of St Petersburg University. Applied Mathematics. Computer Science. Control Processes;Volume 18; Issue 1 | - |
dc.subject | logic ontology | en_GB |
dc.subject | predicate formula | en_GB |
dc.subject | isomorphism of predicate formulas | en_GB |
dc.title | Extraction of common properties of objects for creation of a logic ontology | en_GB |
dc.type | Article | en_GB |
Располагается в коллекциях: | Issue 1 |
Файлы этого ресурса:
Файл | Описание | Размер | Формат | |
---|---|---|---|---|
37-51.pdf | 399,37 kB | Adobe PDF | Просмотреть/Открыть |
Все ресурсы в архиве электронных ресурсов защищены авторским правом, все права сохранены.