Zobrazeno 1 - 10
of 12
pro vyhledávání: '"Yury Savateev"'
Autor:
Mohamed Ragab, Yury Savateev, Helen Oliver, Thanassis Tiropanis, Alexandra Poulovassilis, Adriane Chapman, George Roussos
Publikováno v:
Data Science and Engineering, Vol 9, Iss 4, Pp 431-448 (2024)
Abstract The increasing centralization of the Web raises serious concerns regarding privacy, security, and user autonomy. In response, there has been a renewed interest in the development of secure personal information management systems and a moveme
Externí odkaz:
https://doaj.org/article/fc17356833714cc684c64f0b926d96f0
Our concern is the problem of determining the data complexity of answering an ontology-mediated query (OMQ) formulated in linear temporal logic LTL over (Z
arXiv admin note: text overlap with arXiv:2105.06202
arXiv admin note: text overlap with arXiv:2105.06202
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::aa606751f500adb3d553511b7dc16c3a
http://arxiv.org/abs/2207.06210
http://arxiv.org/abs/2207.06210
Autor:
Marie Fortin, Boris Konev, Vladislav Ryzhikov, Yury Savateev, Frank Wolter, Michael Zakharyaschev
We aim to determine which temporal instance queries can be uniquely characterised by a (polynomial-size) set of positive and negative temporal data examples. We start by considering queries formulated in fragments of propositional linear temporal log
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ffad6c44f86b04ca4de1426cdfab6460
http://arxiv.org/abs/2205.01651
http://arxiv.org/abs/2205.01651
Publikováno v:
Relational and Algebraic Methods in Computer Science ISBN: 9783030887001
RAMiCS
RAMiCS
We prove that, similarly to known \(\textsc {PSpace}\)-completeness of recognising \(\mathsf {FO}(
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3322a347182b1ce7e04a10682ff500a2
https://doi.org/10.1007/978-3-030-88701-8_15
https://doi.org/10.1007/978-3-030-88701-8_15
Autor:
Daniyar S. Shamkanov, Yury Savateev
Publikováno v:
Logic, Language, Information, and Computation ISBN: 9783662595329
WoLLIC
WoLLIC
We present a sequent calculus for the modal Grzegorczyk logic \(\mathsf {Grz}\) allowing non-well-founded proofs and obtain the cut-elimination theorem for it by constructing a continuous cut-elimination mapping acting on these proofs.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7a6b223d34ed2b6c05cf4b5f713aaf3c
https://doi.org/10.1007/978-3-662-59533-6_34
https://doi.org/10.1007/978-3-662-59533-6_34
Autor:
Daniyar S. Shamkanov, Yury Savateev
We present a sequent calculus for the Grzegorczyk modal logic Grz allowing cyclic and other non-well-founded proofs and obtain the cut-elimination theorem for it by constructing a continuous cut-elimination mapping acting on these proofs. As an appli
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0a1f201896bc8e55ec219667811dae31
http://arxiv.org/abs/1804.00955
http://arxiv.org/abs/1804.00955
Autor:
Yury Savateev
Publikováno v:
Annals of Pure and Applied Logic
We present a general method for inserting proofs in Frege systems for classical logic that produces systems that can internalize their own proofs.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6dc77d2cc5e6bca6b2ac49687523fef3
http://www.iam.unibe.ch/ltgpub/2013/sav13a.pdf
http://www.iam.unibe.ch/ltgpub/2013/sav13a.pdf
Autor:
Yury Savateev, Daniyar Shamkanov
Publikováno v:
Logic, Language, Information, and Computation ISBN: 9783662553855
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6c4cf3d75c7efc2d7f48e846cac882aa
https://doi.org/10.1007/978-3-662-55386-2_23
https://doi.org/10.1007/978-3-662-55386-2_23
Autor:
Yury Savateev
Publikováno v:
Annals of Pure and Applied Logic
In this paper, we prove that the derivability problems for product-free Lambek calculus and product-free Lambek calculus allowing empty premises are NP-complete. Also we introduce a new derivability characterization for these calculi.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c4f0505aaa47571868fd8d0994edfaf4
http://www.iam.unibe.ch/ltgpub/2012/sav12.pdf
http://www.iam.unibe.ch/ltgpub/2012/sav12.pdf
Autor:
Yury Savateev
Publikováno v:
Theory of Computing Systems. 46:662-672
Lambek grammars provide a useful tool for studying formal and natural languages. The generative power of unidirectional Lambek grammars equals that of context-free grammars. However, no feasible algorithm was known for deciding membership in the corr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f88f66f3ac339df088486a172d5c7eff
https://doi.org/10.1007/s00224-009-9208-4
https://doi.org/10.1007/s00224-009-9208-4