Extraction of common properties of objects for creation of a logic ontology
DOI:
https://doi.org/10.21638/11701/spbu10.2022.103Abstract
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
Downloads
References
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.
Бениаминов Е. М. Некоторые проблемы широкого внедрения онтологий в IT и направления их решений // Симпозиум «Онтологическое моделирование»: сб. науч. трудов. Москва: ИПИ РАН, 2008. С. 71–82.
Когаловский М. Р., Паринов С. И. Семантическое структурирование контента научных электронных библиотек на основе онтологий // Современные технологии интеграции информационных ресурсов: сб. науч. трудов. СПб.: Президентская библиотека, 2011. Вып. 2. С. 1–13.
Дяченко О. О., Загорулько Ю. А. Подход к коллективной разработке онтологий и баз знаний // Знания — Онтологии — Теории. Всерос. конференция с международным участием / гл. ред. Д. Е. Пальчунов. Новосибирск: Ин-т математики им. С. Л. Соболева СО РАН, 2013. С. 141–149.
Mykhailiuk A., Petrenko M. Machine learning and ontologies as two approaches for building intellectual information systems // Intern. J. “Information Technologies & Knowledge’’. 2019. Vol. 13. N 1. P. 55–75.
Карпов А. Г., Клемешев В. А., Куранов Д. Ю. Определение работоспособности системы, структура которой задана графом // Вестник Санкт-Петербургского университета. Прикладная математикa. Информатика. Процессы управления. 2020. Т. 16. Вып. 1. С. 41–49. https:// doi.org//10.11702/spbu10.2020.104
Гончарова А. Б. Постановка предварительного медицинского диагноза на основе теории нечетких множеств с использованием меры Сугено // Вестник Санкт-Петербургского университета. Прикладная математикa. Информатика. Процессы управления. 2019. Т. 15. Вып. 4. С. 529–543. https://doi.org/10.21638/11702/spbu10.2019.409
Kosovskaya T. Predicate calculus as a tool for AI problems solution: Algorithms and their complexity // Intelligent System. Pt 3. Open access peer-reviewed. Ed. vol. Chatchawal: Chatchawal Wongchoosuk Kasetsart University, 2018. P. 1–20.
Косовская Т. М. Подход к решению задачи построения многоуровневого описания классов на языке исчисления предикатов // Труды СПИИРАН. 2014. № 3 (34). С. 204–217.
Косовская Т. М., Косовский Н. Н. Полиномиальная эквивалентность задач, изоморфизм предикатных формул и изоморфизм графов // Вестник Санкт-Петербургского университета. Математика. Механика. Астрономия. 2019. Т. 6 (64). Вып. 3. С. 430–439. https://doi.org/10.21638/11701/spbu10.2019.308
Babai L. Graph isomorphism in quasipolynomial time (Version 2.1. Unfinished Revision of Version 2 Posted on arXiv May 23, 2017). URL: http://people.cs.uchicago.edu/ laci/17groups/version2.1.pdf (дата обращения: 21.03.2019).
Косовская Т. М., Петров Д. А. Выделение наибольшей общей подформулы предикатных формул для решения ряда задач искусственного интеллекта // Вестник Санкт-Петербургского университета. Прикладная математикa. Информатика. Процессы управления. 2017. Т. 13. Вып. 3. С. 250–263. https://doi.org/10.21638/11702/spbu10.2017.303
References
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.
Beniaminov E. M. Nekotorye problemy shirokogo vnedreniia ontologii v IT i napravleniia ikh reshenii [Some problems of the widespread introduction of ontologies in IT and the directions of their solutions]. Simpozium “Ontologicheskoe modelirovanie’’. Sbornik nauchnykh trudov [ Symposium “Ontological modeling”. A collection of scientific papers]. Moscow, Institute IPI RAN Publ., 2008, pp. 71–82. (In Russian)
Kogalovskii M. R., Parinov S. I. Semanticheskoe strukturirovanie kontenta nauchnykh elektronnykh bibliotek na osnove ontologii [Semantic structuring of the content of scientific electronic libraries based on ontologies]. Sovremennye tekhnologii integratsii informatsionnykh resursov. Sbornik nauchnykh trudov [ Modern technologies for the integration of information resources. A collection of scientific papers]. St Petersburg, President Library Publ., 2011, iss. 2, pp. 1–13. (In Russian)
Diachenko O. O., Zagorulko Yu. A. Podkhod k kollektivnoi razrabotke ontologii i baz znanii [An approach to the collective development of ontologies and knowledge bases]. Znaniia — Ontologii — Teorii. Vserossiiskaia konferentsiia s mezhdunarodnym uchastiem [ Knowledge — Ontologies — Theories. All-Russian Conference with international participation]. Eds. by D. E. Palchunov. Novosibirsk, S. L. Sobolev Institute of Mathematics SO RAN Publ., 2013, pp. 141–149. (In Russian)
Mykhailiuk A., Petrenko M. Machine learning and ontologies as two approaches for building intellectual information systems. Intern. J. “Information Technologies & Knowledge’’, 2019, vol. 13, no. 1, pp. 55–75.
Karpov A. G., Klemeshev V. A, Kuranov D. Yu. Opredelenie pabotosposobnosti sistemy, struktura kotoroy zadana grafom [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, 2020, vol. 16, iss. 1, pp. 41–49. https://doi.org//10.11702/spbu10.2020.104 (In Russian)
Goncharova A. B. Postanovka predvaritelnogo meditsinskogo diagnoza na osnove teorii nechetkih mnozhestv s ispolzovaniem mery Sugeno [Preliminary medical diagnostics based on the fuzzy sets theory using the Sugeno measure]. Vestnik of Saint Petersburg University. Applied Mathematics. Computer Science. Control Processes, 2019, vol. 15, iss. 4, pp. 529–543. https://doi.org//10.21638/11702/spbu10.2019.409 (In Russian)
Kosovskaya T. Predicate calculus as a tool for AI problems solution: Algorithms and their complexity. Intelligent System. Pt 3. Open access peer-reviewed. Ed. vol. Chatchawal, Chatchawal Wongchoosuk Kasetsart University Press, 2018, pp. 1–20.
Kosovskaya T. M. Podhod k resheniyu zadachi postroeniya mnogourovnevogo opisaniya klassov na yazyke ischisleniya predikatov [An approach to the construction of a level description of classes by means of a predicate calculus language]. SPIIRAS Proceedings, 2014, no. 3(34), pp. 204–217. (In Russian)
Kosovskaya T. M., Kosovskii N. N. Polinomialnaya ekvivalentnost zadach izomorfizm predikatnyh formul i izomorfizm grafov [Polynomial equivalence of the problems predicate formulas isomorphism and graph isomorphism]. Vestnik of Saint Petersburg University. Mathematics. Mechanics. Astronomy, 2019, vol. 6(64), iss. 3, pp. 430–439. https://doi.org//10.21638/11701/spbu10.2019.308 (In Russian)
Babai L. Graph isomorphism in quasipolynomial time (Version 2.1. Unfinished Revision of Version 2 Posted on arXiv May 23, 2017). Available at: http://people.cs.uchicago.edu/ laci/17groups/version2.1.pdf (accessed: March 21, 2019).
Kosovskaya T. M., Petrov D. A. Vydelenie naibolshey obschty podformuly predikatnyh formul dlya resheniya ryada zadach iskusstvennogo intellekta [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, 2017, vol. 13, iss. 3, pp. 250–263. https://doi.org//10.21638/11702/spbu10.2017.303 (In Russian)
Downloads
Published
How to Cite
Issue
Section
License
Articles of "Vestnik of Saint Petersburg University. Applied Mathematics. Computer Science. Control Processes" are open access distributed under the terms of the License Agreement with Saint Petersburg State University, which permits to the authors unrestricted distribution and self-archiving free of charge.
