Yury Savateev

Orcid: 0000-0001-5112-4992

According to our database1, Yury Savateev authored at least 21 papers between 2008 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
DESERE: The 1st Workshop on Decentralised Search and Recommendation.
CoRR, 2024

The 1st Workshop on Decentralised Search and Recommendation.
Proceedings of the Companion Proceedings of the ACM on Web Conference 2024, 2024

Unlocking the Potential of Health Data with Decentralised Search in Personal Health Datastores.
Proceedings of the Companion Proceedings of the ACM on Web Conference 2024, 2024

A Demonstration of Decentralized Search Over Solid Personal Online Datastores.
Proceedings of the Companion Proceedings of the ACM on Web Conference 2024, 2024

Decentralized Search over Personal Online Datastores: Architecture and Performance Evaluation.
Proceedings of the Web Engineering - 24th International Conference, 2024

2023
Deciding FO-rewritability of Regular Languages and Ontology-Mediated Queries in Linear Temporal Logic.
J. Artif. Intell. Res., 2023

ESPRESSO: A Framework for Empowering Search on Decentralized Web.
Proceedings of the Web Information Systems Engineering - WISE 2023, 2023

Reverse Engineering of Temporal Queries Mediated by LTL Ontologies.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

2022
Unique Characterisability and Learnability of Temporal Instance Queries.
Proceedings of the 19th International Conference on Principles of Knowledge Representation and Reasoning, 2022

Reverse Engineering of Temporal Queries with and without LTL Ontologies: First Steps (Extended Abstract).
Proceedings of the 35th International Workshop on Description Logics (DL 2022) co-located with Federated Logic Conference (FLoC 2022), 2022

2021
Non-Well-Founded Proofs for the Grzegorczyk Modal Logic.
Rev. Symb. Log., 2021

Deciding FO-Rewritability of Ontology-Mediated Queries in Linear Temporal Logic.
Proceedings of the 28th International Symposium on Temporal Representation and Reasoning, 2021

Deciding FO-definability of Regular Languages.
Proceedings of the Relational and Algebraic Methods in Computer Science, 2021

2020
Recognising FO-rewritability of Ontology-Mediated Queries in Linear Temporal Logic.
Proceedings of the 33rd International Workshop on Description Logics (DL 2020) co-located with the 17th International Conference on Principles of Knowledge Representation and Reasoning (KR 2020), 2020

2019
Cut Elimination for the Weak Modal Grzegorczyk Logic via Non-well-Founded Proofs.
Proceedings of the Logic, Language, Information, and Computation, 2019

2017
Cut-Elimination for the Modal Grzegorczyk Logic via Non-well-founded Proofs.
Proceedings of the Logic, Language, Information, and Computation, 2017

2014
Proof internalization in generalized Frege systems for classical logic.
Ann. Pure Appl. Log., 2014

2012
Product-free Lambek calculus is NP-complete.
Ann. Pure Appl. Log., 2012

2011
Sequent Calculus for Justifications.
Proceedings of the TABLEAUX 2011, 2011

2010
Unidirectional Lambek Grammars in Polynomial Time.
Theory Comput. Syst., 2010

2008
Lambek Grammars with One Division Are Decidable in Polynomial Time.
Proceedings of the Computer Science, 2008


  Loading...