Algorithmic Knowledge

The standard model of knowledge in multi-agent systems suffers from what has been called the logical omniscience problem: agents know all tautologies, and know all the logical consequences of their knowledge. For many types of analysis, this turns out not to be a problem. Knowledge is viewed as being ascribed by the system designer to the agents; agents are not assumed to compute their knowledge in any way, nor is it assumed that they can necessarily answer questions based on their knowledge. Nevertheless, in many applications that we are interested in, agents need to act on their knowledge. In such applications, an externally ascribed notion of knowledge is insufficient: clearly an agent can base his actions only on what he explicitly knows. Furthermore, an agent that has to act on his knowledge has to be able to compute this knowledge; we do need to take into account the algorithms available to the agent, as well as the "effort" required to compute knowledge. In this paper, we show how the standard model can be modified in a natural way to take the computational aspects of knowledge into account.

[1]  Yoav Shoham,et al.  Agent-Oriented Programming , 1992, Artif. Intell..

[2]  Joseph Y. Halpern,et al.  A knowledge-based analysis of zero knowledge , 1988, STOC '88.

[3]  Joseph Y. Halpern USING REASONING ABOUT KNOWLEDGE TO ANALYZE DISTRIBUTED SYSTEMS , 1987 .

[4]  Silvio Micali,et al.  The knowledge complexity of interactive proof-systems , 1985, STOC '85.

[5]  Ronald Fagin,et al.  Reasoning about knowledge , 1995 .

[6]  Piotr Berman,et al.  Towards optimal distributed consensus , 1989, 30th Annual Symposium on Foundations of Computer Science.

[7]  Morgan Kaufmann,et al.  Varieties of self-reference in Theoretical aspects of reasoning about knowledge , .

[8]  K. Konolige A deduction model of belief , 1986 .

[9]  Donald Perlis,et al.  Reasoning situated in time I: basic concepts , 1990, J. Exp. Theor. Artif. Intell..

[10]  Ronald Fagin,et al.  A formal model of knowledge, action, and communication in distributed systems: preliminary report , 1985, PODC '85.

[11]  Joseph Y. Halpern,et al.  A Guide to Completeness and Complexity for Modal Logics of Knowledge and Belief , 1992, Artif. Intell..

[12]  Ronald Fagin,et al.  Modelling Knowledge and Action in Distributed Systems , 1988, Concurrency.

[13]  Joseph Y. Halpern,et al.  Reasoning about knowledge: a survey , 1995 .

[14]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[15]  Avi Wigderson,et al.  On Play by Means of Computing Machines , 1986, TARK.

[16]  Yoram Moses,et al.  Resource-bounded Knowledge , 1988, TARK.

[17]  N. Megiddo On computable beliefs of rational machines , 1989 .

[18]  Ronald Fagin,et al.  Belief, Awareness, and Limited Reasoning. , 1987, Artif. Intell..

[19]  Ramaswamy Ramanujam,et al.  Distributed Processes and the Logic of Knowledge , 1985, Logic of Programs.

[20]  Joseph Y. Halpern,et al.  Knowledge, probability, and adversaries , 1989, PODC '89.

[21]  Hector J. Levesque,et al.  A Logic of Implicit and Explicit Belief , 1984, AAAI.

[22]  A. Rubinstein Finite automata play the repeated prisoner's dilemma , 1986 .

[23]  Jennifer J. Elgot-Drapkin,et al.  Step-Logic and the Three-Wise-Men Problem , 1991, AAAI.

[24]  Joseph Y. Halpern,et al.  Model Checking vs. Theorem Proving: A Manifesto , 1991, KR.

[25]  A. Neyman Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma , 1985 .

[26]  Jaakko Hintikka,et al.  Impossible possible worlds vindicated , 1975, J. Philos. Log..

[27]  Leslie Pack Kaelbling,et al.  The Synthesis of Digital Machines With Provable Epistemic Properties , 1986, TARK.

[28]  Kenneth G. Binmore,et al.  Essays on Foundations of Game Theory , 1982 .

[29]  E Thorp,et al.  A FAVORABLE STRATEGY FOR TWENTY-ONE. , 1961, Proceedings of the National Academy of Sciences of the United States of America.

[30]  K. Mani Chandy,et al.  How processes learn , 1985, ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing.

[31]  Joseph Y. Halpern,et al.  Knowledge and common knowledge in a distributed environment , 1984, JACM.