Knowledge Consistency: A Useful Suspension of Disbelief
Gil Neiger · 1988
The study of knowledge is of great use in distributed computer systems. It has led to better understanding of existing algorithms for such systems, as well as the development of new knowledge-based algorithm.~. The ability to achieve certain states of knowledge (e.g., common knowledge) provides a powerful tool for designing such algorithms. Un-fortunately, it has been shown that for many systems it is impossible to achieve these states of knowledge. In this paper we consider alternative interpretations of knowl-edge under which these states can be achieved. We explore the notion of consistent interpretations, and show how they can be used to circumvent the known impossibility results in a number of cases. This may lead to greater applicability of knowledge-based algorithms.