no code implementations • 22 Jul 2019 • Krzysztof R. Apt, Dominik Wojtczak
To establish these results we showed that both the definition of semantics and of truth of the underlying logic are decidable.
no code implementations • 27 Jul 2017 • Krzysztof R. Apt, Dominik Wojtczak
This implies that implementability, partial correctness and termination of distributed epistemic gossip protocols that use non-nested common knowledge operator is decidable, as well.
no code implementations • 24 Jun 2016 • Krzysztof R. Apt, Davide Grossi, Wiebe van der Hoek
Gossip protocols aim at arriving, by means of point-to-point or group communications, at a situation in which all the agents know each other's secrets.
no code implementations • 25 Apr 2012 • Krzysztof R. Apt, Evangelos Markakis
In turn, the problems of determining whether a given node adopts some (respectively, a given) product in some (respectively, all) network(s) are either co-NP complete or can be solved in polynomial time.
Social and Information Networks Physics and Society
no code implementations • 12 May 2011 • Krzysztof R. Apt, Evangelos Markakis
We show that the problem of determining whether a given node has to adopt some (resp.
Social and Information Networks Data Structures and Algorithms Physics and Society
