Extraction of common properties of objects for creation of a logic ontology
Vestnik Sankt-Peterburgskogo universiteta. Prikladnaâ matematika, informatika, processy upravleniâ, Tome 18 (2022) no. 1, pp. 37-51 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

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.
Keywords: logic ontology, predicate formula, isomorphism of predicate formulas.
@article{VSPUI_2022_18_1_a2,
     author = {T. M. Kosovskaya and N. N. Kosovskii},
     title = {Extraction of common properties of objects for creation of a logic ontology},
     journal = {Vestnik Sankt-Peterburgskogo universiteta. Prikladna\^a matematika, informatika, processy upravleni\^a},
     pages = {37--51},
     year = {2022},
     volume = {18},
     number = {1},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VSPUI_2022_18_1_a2/}
}
TY  - JOUR
AU  - T. M. Kosovskaya
AU  - N. N. Kosovskii
TI  - Extraction of common properties of objects for creation of a logic ontology
JO  - Vestnik Sankt-Peterburgskogo universiteta. Prikladnaâ matematika, informatika, processy upravleniâ
PY  - 2022
SP  - 37
EP  - 51
VL  - 18
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/VSPUI_2022_18_1_a2/
LA  - ru
ID  - VSPUI_2022_18_1_a2
ER  - 
%0 Journal Article
%A T. M. Kosovskaya
%A N. N. Kosovskii
%T Extraction of common properties of objects for creation of a logic ontology
%J Vestnik Sankt-Peterburgskogo universiteta. Prikladnaâ matematika, informatika, processy upravleniâ
%D 2022
%P 37-51
%V 18
%N 1
%U http://geodesic.mathdoc.fr/item/VSPUI_2022_18_1_a2/
%G ru
%F VSPUI_2022_18_1_a2
T. M. Kosovskaya; N. N. Kosovskii. Extraction of common properties of objects for creation of a logic ontology. Vestnik Sankt-Peterburgskogo universiteta. Prikladnaâ matematika, informatika, processy upravleniâ, Tome 18 (2022) no. 1, pp. 37-51. http://geodesic.mathdoc.fr/item/VSPUI_2022_18_1_a2/

[1] Noy N. F., McGuinness D. L., Ontology development 101: A guide to creating your first ontology, Stanford Knowledge Systems Laboratory Technical Report KSL-01-05 and Stanford Medical Informatics Technical Report SMI-2001-0880, Stanford, March 2001

[2] Beniaminov E. M., “Some problems of the widespread introduction of ontologies in IT and the directions of their solutions”, Symposium “Ontological modeling”, A collection of scientific papers, Institute IPI RAN Publ, M., 2008, 71–82 (In Russian)

[3] Kogalovskii M. R., Parinov S. I., “Semantic structuring of the content of scientific electronic libraries based on ontologies”, A collection of scientific papers, Modern technologies for the integration of information resources, 2, President Library Publ, St Petersburg, 2011, 1–13 (In Russian)

[4] Diachenko O. O., Zagorulko Yu. A., “An approach to the collective development of ontologies and knowledge bases”, Knowledge — Ontologies — Theories, All-Russian Conference with international participation, eds. D. E. Palchunov, S. L. Sobolev Institute of Mathematics SO RAN Publ, Novosibirsk, 2013, 141–149 (In Russian)

[5] Mykhailiuk A., Petrenko M., “Machine learning and ontologies as two approaches for building intellectual information systems”, Intern. J. "Information Technologies $\$ Knowledge", 13:1 (2019), 55–75

[6] Karpov A. G., Klemeshev V. A, Kuranov D. Yu., “Determining the ability to work of the system, the structure of which is given using graph”, Vestnik of Saint Petersburg University. Applied Mathematics. Computer Science. Control Processes, 16:1 (2020), 41–49 (In Russian) | DOI | MR

[7] Goncharova A. B., “Preliminary medical diagnostics based on the fuzzy sets theory using the Sugeno measure”, Vestnik of Saint Petersburg University. Applied Mathematics. Computer Science. Control Processes, 15:4 (2019), 529–543 (In Russian) | DOI | MR

[8] Kosovskaya T., “Predicate calculus as a tool for AI problems solution: Algorithms and their complexity”, Intelligent System, v. 3, Open access peer-reviewed, Chatchawal Wongchoosuk Kasetsart University, Chatchawal, 2018, 1–20

[9] Kosovskaya T. M., “An approach to the construction of a level description of classes by means of a predicate calculus language”, SPIIRAS Proceedings, 2014, no. 3(34), 204–217 (In Russian)

[10] Kosovskaya T. M., Kosovskii N. N., “Polynomial equivalence of the problems predicate formulas isomorphism and graph isomorphism”, Vestnik of Saint Petersburg University. Mathematics. Mechanics. Astronomy, 6:3(64) (2019), 430–439 (In Russian) | DOI | MR | Zbl

[11] Babai L., Graph isomorphism in quasipolynomial time (Version 2.1. Unfinished Revision of Version 2 Posted on arXiv May 23, 2017 (accessed: March 21, 2019) http://people.cs.uchicago.edu/l̃aci/17groups/version2.1.pdf

[12] Kosovskaya T. M., Petrov D. A., “Extraction of a maximal common sub-formula of predicate formulas for the solving of some artificial intelligence problems”, Vestnik of Saint Petersburg University. Applied Mathematics. Computer Science. Control Processes, 13:3 (2017), 250–263 (In Russian) | DOI | MR