From post

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.

 

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

Deciding FO-rewritability of Regular Languages and Ontology-Mediated Queries in Linear Temporal Logic., , , и . J. Artif. Intell. Res., (2023)Cut Elimination for the Weak Modal Grzegorczyk Logic via Non-well-Founded Proofs., и . WoLLIC, том 11541 из Lecture Notes in Computer Science, стр. 569-583. Springer, (2019)The 1st Workshop on Decentralised Search and Recommendation., , , , , , , , и . WWW (Companion Volume), стр. 1705-1708. ACM, (2024)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)Reverse Engineering of Temporal Queries with and without LTL Ontologies: First Steps (Extended Abstract)., , , , , и . Description Logics, том 3263 из CEUR Workshop Proceedings, CEUR-WS.org, (2022)Deciding FO-rewritability of regular languages and ontology-mediated queries in Linear Temporal Logic., , , и . CoRR, (2022)Unique Characterisability and Learnability of Temporal Instance Queries., , , , , и . KR, (2022)Decentralized Search over Personal Online Datastores: Architecture and Performance Evaluation., , , , , , , и . ICWE, том 14629 из Lecture Notes in Computer Science, стр. 49-64. Springer, (2024)Lambek Grammars with One Division Are Decidable in Polynomial Time.. CSR, том 5010 из Lecture Notes in Computer Science, стр. 273-282. Springer, (2008)