Simplifying the Design of Knowledge-Based Algorithms Using Knowledge Consistency

Processor knowledge is an important tool in the study of distributed computer systems. It has led to better understanding of existing algorithms for such systems and to the development of new knowledge-based algorithms. Some of these algorithms use forms of knowledge (e. g. , common knowledge) that cannot be achieved in certain systems. This paper considers alternative interpretations of knowledge under which these forms of knowledge can be achieved. It explores consistent knowledge interpretations and shows 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.

Authors

• G. Neiger

Keywords

No keywords are indexed for this paper.