( en | de | ru )

 

Disambiguation of "Savateev, Yury"

Author of the publication

copydeleteadd this publication to your clipboard
Deciding FO-rewritability of regular languages and ontology-mediated queries in Linear Temporal Logic.

, , , and . 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. You can also use the button next to the name to display some publications already assigned to the person.

Ruslan Yuryev

Yury Postnikov

Yury Markovskiy

Yury Valdau

Yury Lebedev

 

Other publications of authors with the same name

Cut Elimination for the Weak Modal Grzegorczyk Logic via Non-well-Founded Proofs., and . WoLLIC, volume 11541 of Lecture Notes in Computer Science, page 569-583. Springer, (2019)Deciding FO-rewritability of Regular Languages and Ontology-Mediated Queries in Linear Temporal Logic., , , and . J. Artif. Intell. Res., (2023)Deciding FO-rewritability of regular languages and ontology-mediated queries in Linear Temporal Logic., , , and . CoRR, (2022)Non-Well-Founded Proofs for the Grzegorczyk Modal Logic., and . Rev. Symb. Log., 14 (1): 22-50 (2021)Unique Characterisability and Learnability of Temporal Instance Queries., , , , , and . KR, (2022)Product-free Lambek calculus is NP-complete.. Ann. Pure Appl. Log., 163 (7): 775-788 (2012)ESPRESSO: A Framework for Empowering Search on Decentralized Web., , , , , , and . WISE, volume 14306 of Lecture Notes in Computer Science, page 360-375. Springer, (2023)Lambek Grammars with One Division Are Decidable in Polynomial Time.. CSR, volume 5010 of Lecture Notes in Computer Science, page 273-282. Springer, (2008)Reverse Engineering of Temporal Queries Mediated by LTL Ontologies., , , , , and . IJCAI, page 3230-3238. ijcai.org, (2023)Product-Free Lambek Calculus Is NP-Complete.. LFCS, volume 5407 of Lecture Notes in Computer Science, page 380-394. Springer, (2009)