Reasoning about Noisy Sensors in the Situation Calculus
Fahiem Bacchus, Joseph Y. Halpern, et al.
IJCAI 1995
This paper studies the problem of perfectly secure communication in general network in which processors and communication lines may be faulty. Lower bounds are obtained on the connectivity required for successful secure communication. Efficient algorithms are obtained that operate with this connectivity and rely on no complexity-theoretic assumptions. These are the first algorithms for secure communication in a general network to simultaneously achieve the three goals of perfect secrecy, perfect resiliency, and worst-case time linear in the diameter of the network. © 1993, ACM. All rights reserved.
Fahiem Bacchus, Joseph Y. Halpern, et al.
IJCAI 1995
Benjamin N. Grosof
AAAI-SS 1993
Dzung Phan, Vinicius Lima
INFORMS 2023
Alain Vaucher, Philippe Schwaller, et al.
AMLD EPFL 2022