Communities
Connect sessions
AI calendar
Organizations
Join Slack
Contact Sales
Search
Open menu
Home
Papers
2011.13630
Cited By
v1
v2 (latest)
Logical Obstruction to Set Agreement Tasks for Superset-Closed Adversaries
27 November 2020
Koki Yagi
S. Nishimura
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"Logical Obstruction to Set Agreement Tasks for Superset-Closed Adversaries"
5 / 5 papers shown
Simplicial Models for the Epistemic Logic of Faulty Agents
Boletín de la Sociedad Matematica Mexicana (BSMM), 2023
Eric Goubault
Roman Kniazev
J. Ledent
S. Rajsbaum
190
6
0
02 Nov 2023
Partial Product Updates for Agents of Detectable Failure and Logical Obstruction to Task Solvability
Daisuke Nakai
Masaki Muramatsu
Susumu Nishimura
154
1
0
29 Mar 2023
Proving Unsolvability of Set Agreement Task with Epistemic mu-Calculus
Susumu Nishimura
51
2
0
13 May 2022
Determining Existence of Logical Obstructions to the Distributed Task Solvability
Sou Hoshino
134
3
0
10 Mar 2022
A Simplicial Model for
K
B
4
n
KB4_n
K
B
4
n
: Epistemic Logic with Agents that May Die
Symposium on Theoretical Aspects of Computer Science (STACS), 2021
Éric Goubault
J. Ledent
S. Rajsbaum
90
17
0
23 Aug 2021
1
Page 1 of 1
