A theory of goal-oriented communication

We put forward a general theory of goal-oriented communication, where communication is not an end in itself, but rather a means to achieving some goals of the communicating parties. Focusing on goals provides a framework for addressing the problem of potential "misunderstanding" during communication, where the misunderstanding arises from lack of initial agreement on what protocol and/or language is being used in communication. Despite the enormous diversity among the goals of communication, we propose a simple model that captures all goals.

[1]  Carsten Lund,et al.  Algebraic methods for interactive proof systems , 1992, JACM.

[2]  Wendy Hall,et al.  The Semantic Web Revisited , 2006, IEEE Intelligent Systems.

[3]  Florian Michahelles,et al.  An Architectural Approach Towards the Future Internet of Things , 2011, Architecting the Internet of Things.

[4]  Silvio Micali,et al.  The Knowledge Complexity of Interactive Proof Systems , 1989, SIAM J. Comput..

[5]  Mihir Bellare,et al.  The Complexity of Decision Versus Search , 1991, SIAM J. Comput..

[6]  Santosh S. Vempala,et al.  Semantic Communication for Simple Goals Is Equivalent to On-line Learning , 2011, ALT.

[7]  C. E. SHANNON,et al.  A mathematical theory of communication , 1948, MOCO.

[8]  Lance Fortnow,et al.  BPP has subexponential time simulations unlessEXPTIME has publishable proofs , 2005, computational complexity.

[9]  Madhu Sudan,et al.  Universal Semantic Communication II: A Theory of Goal-Oriented Communication , 2008, Electron. Colloquium Comput. Complex..

[10]  Brendan A. Juba,et al.  Universal semantic communication I , 2008, Electron. Colloquium Comput. Complex..

[11]  Manuel Blum,et al.  Designing programs that check their work , 1989, STOC '89.

[12]  Dr. Marcus Hutter,et al.  Universal artificial intelligence , 2004 .

[13]  Adi Shamir,et al.  IP = PSPACE , 1992, JACM.

[14]  Madhu Sudan,et al.  Efficient Semantic Communication via Compatible Beliefs , 2011, ICS.

[15]  Carsten Lund,et al.  Non-deterministic exponential time has two-prover interactive protocols , 1992, computational complexity.

[16]  Adam Tauman Kalai,et al.  Compression without a common prior: an information-theoretic justification for ambiguity in language , 2011, ICS.

[17]  Oded Goldreich,et al.  A theory of goal-oriented communication , 2012, JACM.

[18]  Florian Michahelles,et al.  Architecting the Internet of Things , 2011 .

[19]  Silvio Micali,et al.  Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems , 1991, JACM.

[20]  Ludwig Wittgenstein,et al.  The Blue and Brown Books: Preliminary Studies for the 'Philosophical Investigations' , 1980 .

[21]  J. Dewey.  Experience and Nature , 1960 .

[22]  James A. Hendler,et al.  The Semantic Web" in Scientific American , 2001 .

[23]  Devika Subramanian,et al.  Provably Bounded Optimal Agents , 1993, IJCAI.