( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Deciding FO-rewritability of regular languages and ontology-mediated queries in Linear Temporal Logic.

, , , и . CoRR, (2022)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Ruslan Yuryev

Yury Postnikov

Yury Markovskiy

Yury Valdau

Yury Lebedev

 

Другие публикации лиц с тем же именем

Cut Elimination for the Weak Modal Grzegorczyk Logic via Non-well-Founded Proofs., и . WoLLIC, том 11541 из Lecture Notes in Computer Science, стр. 569-583. Springer, (2019)Deciding FO-rewritability of Regular Languages and Ontology-Mediated Queries in Linear Temporal Logic., , , и . J. Artif. Intell. Res., (2023)The 1st Workshop on Decentralised Search and Recommendation., , , , , , , , и . WWW (Companion Volume), стр. 1705-1708. ACM, (2024)Deciding FO-rewritability of regular languages and ontology-mediated queries in Linear Temporal Logic., , , и . CoRR, (2022)Non-Well-Founded Proofs for the Grzegorczyk Modal Logic., и . Rev. Symb. Log., 14 (1): 22-50 (2021)Unique Characterisability and Learnability of Temporal Instance Queries., , , , , и . KR, (2022)Proof internalization in generalized Frege systems for classical logic.. Ann. Pure Appl. Log., 165 (1): 340-356 (2014)Unidirectional Lambek Grammars in Polynomial Time.. Theory Comput. Syst., 46 (4): 662-672 (2010)Cut-Elimination for the Modal Grzegorczyk Logic via Non-well-founded Proofs., и . WoLLIC, том 10388 из Lecture Notes in Computer Science, стр. 321-335. Springer, (2017)Product-Free Lambek Calculus Is NP-Complete.. LFCS, том 5407 из Lecture Notes in Computer Science, стр. 380-394. Springer, (2009)