Zobrazeno 1 - 10
of 39
pro vyhledávání: '"Roman Kuznets"'
Autor:
Victor Dyatlov, Roman Kuznetsov
Publikováno v:
Проект Байкал, Vol 11, Iss 42, Pp 120-129 (2014)
On the turn of the 1980s, a Chinese market named ‘Shanghai’ spontaneously appeared in the center of Irkutsk. Initially it was just a venue where several hundreds of small sellers sold goods brought from China. A primitive infrastructure included
Externí odkaz:
https://doaj.org/article/3ac24b8782b5465090bbfbff328194b2
Publikováno v:
Logical Methods in Computer Science, Vol Volume 19, Issue 4 (2023)
Combinatorial topology is used in distributed computing to model concurrency and asynchrony. The basic structure in combinatorial topology is the simplicial complex, a collection of subsets called simplices of a set of vertices, closed under containm
Externí odkaz:
https://doaj.org/article/0e191e2a9a2a4544acfc06eacbb6a9ea
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 297, Iss Proc. TARK 2019, Pp 293-312 (2019)
Causality is an important concept both for proving impossibility results and for synthesizing efficient protocols in distributed computing. For asynchronous agents communicating over unreliable channels, causality is well studied and understood. This
Externí odkaz:
https://doaj.org/article/5e11791474a14113afebcaba36e17a98
Publikováno v:
Minds and Machines.
The debate around the notions of a priori knowledge and a posteriori knowledge has proven crucial for the development of many fields in philosophy, such as metaphysics, epistemology, metametaphysics etc. We advocate that the recent debate on the two
Publikováno v:
Electronic Proceedings in Theoretical Computer Science. 335:139-153
In this paper, we provide an epistemic analysis of a simple variant of the fundamental consistent broadcasting primitive for byzantine fault-tolerant asynchronous distributed systems. Our Firing Rebels with Relay (FRR) primitive enables agents with a
Autor:
Björn Lellmann, Roman Kuznets
Publikováno v:
Journal of Logic and Computation. 31:797-831
We introduce a novel, semantically inspired method of constructing nested sequent calculi for propositional intermediate logics. Applying recently developed methods for proving Craig interpolation to these nested sequent calculi, we obtain constructi
Publikováno v:
PRIMA 2020: Principles and Practice of Multi-Agent Systems ISBN: 9783030693213
Recently, a detailed epistemic reasoning framework for multi-agent systems with byzantine faulty asynchronous agents and possibly unreliable communication was introduced. We have developed a modular extension framework implemented on top of it, which
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8170f0f2060bbabe4b0cdf5cc2438dc0
https://doi.org/10.1007/978-3-030-69322-0_30
https://doi.org/10.1007/978-3-030-69322-0_30
Publikováno v:
Logic, Language, Information, and Computation ISBN: 9783030888527
WoLLIC
WoLLIC
A modular proof-theoretic framework was recently developed to prove Craig interpolation for normal modal logics based on generalizations of sequent calculi (e.g., nested sequents, hypersequents, and labelled sequents). In this paper, we turn to unifo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2f53cdbd37d47c3e9674d3b1d7a7af2b
https://doi.org/10.1007/978-3-030-88853-4_21
https://doi.org/10.1007/978-3-030-88853-4_21
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 297, Iss Proc. TARK 2019, Pp 293-312 (2019)
Causality is an important concept both for proving impossibility results and for synthesizing efficient protocols in distributed computing. For asynchronous agents communicating over unreliable channels, causality is well studied and understood. This
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::07f7da6cacb2a85e3b4956da410140ef
http://arxiv.org/abs/1907.09112
http://arxiv.org/abs/1907.09112
Autor:
Lutz Straßburger, Roman Kuznets
Publikováno v:
Archive for Mathematical Logic
Archive for Mathematical Logic, Springer Verlag, 2019, 58 (3-4), pp.359-385. ⟨10.1007/s00153-018-0636-1⟩
Archive for Mathematical Logic, 2019, 58 (3-4), pp.359-385. ⟨10.1007/s00153-018-0636-1⟩
Archive for Mathematical Logic, Springer Verlag, 2019, 58 (3-4), pp.359-385. ⟨10.1007/s00153-018-0636-1⟩
Archive for Mathematical Logic, 2019, 58 (3-4), pp.359-385. ⟨10.1007/s00153-018-0636-1⟩
International audience; We develop multi-conclusion nested sequent calculi for the fifteen logics of the intuitionistic modal cube between IK and IS5. The proof of cut-free completeness for all logics is provided both syntactically via a Maehara-styl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::63000ae374ae55346949fa5ed9c2387d
https://hal.inria.fr/hal-01942240/document
https://hal.inria.fr/hal-01942240/document