Context-free path querying with all-path semantics using matrices with sets of intermediate vertices

Autor: Rustam Sh. Azimov, Semyon V. Grigorev

Publikováno v: Naučno-tehničeskij Vestnik Informacionnyh Tehnologij, Mehaniki i Optiki, Vol 21, Iss 4, Pp 499-505 (2021)

The study considers the problem of context-free path querying with all-path query semantics. This problem consists in finding all paths of the graph, the labels on the edges of which form words from the language generated by the input context-free

Externí odkaz: https://doaj.org/article/c951272bf7544ca3aba8b00e3176a81e

Recursive Expressions for SPARQL Property Paths

Autor: Semyon V. Grigorev, Umberto Souza da Costa, Martin A. Musicante, Ciro M. Medeiros

Publikováno v: ADBIS, TPDL and EDA 2020 Common Workshops and Doctoral Consortium
ADBIS, TPDL and EDA 2020 Common Workshops and Doctoral Consortium, 1260, Springer International Publishing, pp.72-84, 2020, Communications in Computer and Information Science, ⟨10.1007/978-3-030-55814-7_6⟩
ADBIS, TPDL and EDA 2020 Common Workshops and Doctoral Consortium, 2020, Lyon, France. pp.72-84, ⟨10.1007/978-3-030-55814-7_6⟩
ADBIS, TPDL and EDA 2020 Common Workshops and Doctoral Consortium ISBN: 9783030558130
ADBIS/TPDL/EDA Workshops

Regular expressions are used in SPARQL property paths to query RDF graphs. However, regular expressions can only define the most limited class of languages, called regular languages. Context-free languages are a wider class containing all regular lan

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4b1149c91545ea1d13ec242858bc85ed
https://hal.archives-ouvertes.fr/hal-03456326

Context-Free Path Querying by Kronecker Product

Autor: Semyon V. Grigorev, Ilya Epelbaum, Egor Orachev, Rustam Azimov

Publikováno v: Advances in Databases and Information Systems ISBN: 9783030548315
ADBIS

Context-free path queries (CFPQ) extend the regular path queries (RPQ) by allowing context-free grammars to be used as constraints for paths. Algorithms for CFPQ are actively developed, but J. Kuijpers et al. have recently concluded, that existing al

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::3090617410ece07f2bb7d2da56a032c3
https://doi.org/10.1007/978-3-030-54832-2_6

On Secondary Structure Analysis by Using Formal Grammars and Artificial Neural Networks

Autor: Semyon V. Grigorev, Polina Lunina

Publikováno v: Computational Intelligence Methods for Bioinformatics and Biostatistics ISBN: 9783030630607
CIBB

A way to combine formal grammars and artificial neural networks for biological sequences processing was recently proposed. In this approach, an ordinary grammar encodes primitive features of the RNA secondary structure, parsing is utilized for featur

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::0413226e6b702221d8f153c8717228cf
https://doi.org/10.1007/978-3-030-63061-4_18

Certified Grammar Transformation to Chomsky Normal Form in F*

Autor: M.I. Polubelova, S.N. Bozhko, Semyon V. Grigorev

Publikováno v: Труды Института системного программирования РАН, Vol 28, Iss 2, Pp 127-138 (2018)

Certified programming allows to prove that the program meets its specification. The check of correctness of a program is performed at compile time, which guarantees that the program always runs as specified. Hence, there is no need to test certified

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9270aa87f2ebec7415de3e6653b65368
https://doi.org/10.15514/ispras-2016-28(2)-8