title: Extraction of common properties of objects for creation of a logic ontology
metadata.name: dc.contributor.author
metadata.value: Kosovskaya, Tatiana M.
metadata.lang: -
metadata.name: dc.contributor.author
metadata.value: Kosovskii, Nikolai N.
metadata.lang: -
metadata.name: dc.date.accessioned
metadata.value: 2022-06-23T13:13:51Z
metadata.lang: -
metadata.name: dc.date.available
metadata.value: 2022-06-23T13:13:51Z
metadata.lang: -
metadata.name: dc.date.issued
metadata.value: 2022-03
metadata.lang: -
metadata.name: dc.identifier.citation
metadata.value: 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.
metadata.lang: en_GB
metadata.name: dc.identifier.other
metadata.value: https://doi.org/10.21638/11701/spbu10.2022.103
metadata.lang: -
metadata.name: dc.identifier.uri
metadata.value: http://hdl.handle.net/11701/36930
metadata.lang: -
metadata.name: dc.description.abstract
metadata.value: 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.
metadata.lang: en_GB
metadata.name: dc.description.sponsorship
metadata.value: This work was carried out with the financial support of St Petersburg State University (project
  N 73555239).
metadata.lang: en_GB
metadata.name: dc.language.iso
metadata.value: ru
metadata.lang: en_GB
metadata.name: dc.publisher
metadata.value: St Petersburg State University
metadata.lang: en_GB
metadata.name: dc.relation.ispartofseries
metadata.value: Vestnik of St Petersburg University. Applied Mathematics. Computer Science. Control Processes;Volume 18; Issue 1
metadata.lang: -
metadata.name: dc.subject
metadata.value: logic ontology
metadata.lang: en_GB
metadata.name: dc.subject
metadata.value: predicate formula
metadata.lang: en_GB
metadata.name: dc.subject
metadata.value: isomorphism of predicate formulas
metadata.lang: en_GB
metadata.name: dc.title
metadata.value: Extraction of common properties of objects for creation of a logic ontology
metadata.lang: en_GB
metadata.name: dc.type
metadata.value: Article
metadata.lang: en_GB
resources.filename: 37-51.pdf
resources.url: https://dspace.spbu.ru/bitstream/11701/36930/1/37-51.pdf
resources.format: Adobe PDF
resources.size: 399,37 kB