title: Polynomial equivalence of the problems predicate formulas isomorphism and graph isomorphism
metadata.name: dc.contributor.author
metadata.value: Kosovskaya, Tatiana M.
metadata.lang: -
metadata.name: dc.contributor.author
metadata.value: Kosovskii, Nikolay N.
metadata.lang: -
metadata.name: dc.date.accessioned
metadata.value: 2019-09-05T16:48:16Z
metadata.lang: -
metadata.name: dc.date.available
metadata.value: 2019-09-05T16:48:16Z
metadata.lang: -
metadata.name: dc.date.issued
metadata.value: 2019-09
metadata.lang: -
metadata.name: dc.identifier.citation
metadata.value: 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, 2019, vol. 6 (64), issue 3, pp. 430–439.
metadata.lang: en_GB
metadata.name: dc.identifier.other
metadata.value: https://doi.org/10.21638/11701/spbu01.2019.308
metadata.lang: -
metadata.name: dc.identifier.uri
metadata.value: http://hdl.handle.net/11701/16319
metadata.lang: -
metadata.name: dc.description.abstract
metadata.value: A problem of isomorphism checking of two elementary conjunctions of predicate formulas is under consideration. Such a problem appears while solving some Artificial Intelligence problems, admitting formalization by means of predicate calculus language. Polynomial equivalence of this problem with the Graph Isomorphism (GI) problem is proved.
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. Mathematics. Mechanics. Astronomy;Volume 6 (64); Issue 3
metadata.lang: -
metadata.name: dc.subject
metadata.value: graph isomorphism
metadata.lang: en_GB
metadata.name: dc.subject
metadata.value: predicate formulas isomorphism
metadata.lang: en_GB
metadata.name: dc.subject
metadata.value: GI-completeness
metadata.lang: en_GB
metadata.name: dc.title
metadata.value: Polynomial equivalence of the problems predicate formulas isomorphism and graph isomorphism
metadata.lang: en_GB
metadata.name: dc.type
metadata.value: Article
metadata.lang: en_GB
resources.filename: 430-439.pdf
resources.url: https://dspace.spbu.ru/bitstream/11701/16319/1/430-439.pdf
resources.format: Adobe PDF
resources.size: 324,75 kB