Pragmatic reasoning in bridge

In this paper we argue that bidding in the game of Contract Bridge can profitably be regarded as a micro-world suitable for experimenting with pragmatics. We sketch an analysis in which a “bidding system” is treated as the semantics of an artificial language, and show how this “language”, despite its apparent simplicity, is capable of supporting a wide variety of common speech acts parallel to those in natural languages; we also argue that the reason for the relatively unsuccessful nature of previous attempts to write strong Bridge playing programs has been their failure to address the need to reason explicitly about knowledge, pragmatics, probabilities and plans. We give an overview of , a system currently under development, which embodies these ideas in concrete form, using a combination of rule-based inference, stochastic simulation, and “neural-net” learning. Examples are given illustrating the functionality of the system in its current form. The research reported in this paper was undertaken from Summer 1989 to Summer 1991 at the Swedish Institute of Computer Science. Much of the content of the present paper, from Section 1.3 onward, appeared in almost the same form as reference [Gambäck et al 1990]. Since publication of this work, a number of advances in Computer Bridge Playing have taken place which largely follow the approach outlined here.

[1]  Chun-Hung Tzeng,et al.  A Theory of Heuristic Information in Game-Tree Search , 1988, Symbolic Computation.

[2]  Murray Campbell,et al.  Using Chunking to Solve Chess Pawn Endgames , 1984, Artif. Intell..

[3]  Alan Bundy,et al.  An Adaptation of Proof-Planning to Declarer Play in Bridge , 1992, ECAI.

[4]  Anthony Ira Wasserman Achievement of skill and generality in an artificial intelligence program , 1970 .

[5]  Richard A. Epstein,et al.  The Theory of Gambling and Statistical Logic , 1977 .

[6]  Stuart J. Russell,et al.  Principles of Metareasoning , 1989, Artif. Intell..

[7]  R. Lippmann,et al.  An introduction to computing with neural nets , 1987, IEEE ASSP Magazine.

[8]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.

[9]  Murray S. Campbell Chunking as an abstraction mechanism , 1987 .

[10]  J. R. Quinlan A Knowledge-Based System for Locating Missing High Cards in Bridge , 1979, IJCAI.

[11]  Jesfis Peral,et al.  Heuristics -- intelligent search strategies for computer problem solving , 1984 .

[12]  Frank van Harmelen,et al.  Truth and Modality for Knowledge Representation , 1990, AI Commun..

[13]  Leon Sterling,et al.  PYTHON: An Expert Squeezer , 1990, J. Log. Program..

[14]  Robert C. Moore A Formal Theory of Knowledge and Action , 1984 .

[15]  Kathryn B. Laskey,et al.  Assumptions, Beliefs and Probabilities , 1989, Artif. Intell..

[16]  M. Beardsley Expression and Meaning: Studies in the Theory of Speech Acts , 1981 .

[17]  Elwyn R. Berlekamp,et al.  Program for Double-Dummy Bridge Problems—A New Strategy for Mechanical Game Playing , 1963, JACM.

[18]  Terrence J. Sejnowski,et al.  A Parallel Network that Learns to Play Backgammon , 1989, Artif. Intell..

[19]  L. M. MILNE-THOMSON,et al.  Théorie mathématique du bridge à la portée de tous , 1946, Nature.

[20]  Geoffrey E. Hinton,et al.  Learning internal representations by error propagation , 1986 .

[21]  A. M. Stanier,et al.  BRIBIP: A Bridge Bidding Program , 1975, IJCAI.