The game-theoretic interpretation of logic is due to Hintikka. In this approach, any attempt to establish the truth or falsity of an expression, S, in an interpreted language, L, is correlated with a two-person, zero-sum, perfect information game, G(S), played according to the rules of L. These games can be thought of as constituting ‘idealised processes of verification’. Informally, one can think of the two players as oneself and ‘Nature’, and the game consists of one seeking support for S, while Nature looks for a refutation.
KeywordsHexagonal Tate Alan
Unable to display preview. Download preview PDF.
- Marr, D. Analysis of occluding contour. Proc. Roy. Soc. London, B197:441–475, 1977.Google Scholar
- Gazdar, G., Klein, E., Pullum, F. and Sag, I. Generalised Phrase Structure Grammar. Blackwell, Oxford, 1985Google Scholar
- Feigenbaum, E.A., Buchanan, B.G. and Lederberg, J. On generality and problem solving: a case study using the Dendral program. In B. Meitzer and D. Michie, editors, Machine Intelligence 6, pages 165–196. Edinburgh University Press, Edinburgh, 1971.Google Scholar
- Fikes, R.E. Knowledge Representation in Automatic Planning Systems. Technical Note 119, SRI, Menlo Park, California.Google Scholar
- Tate, A. Using Goal Structure to direct search in a Problem Solver. PhD thesis, MIRU, Edinburgh, 1975.Google Scholar
- Golay, M.J.E. Hexagonal parallel pattern transformations. IEEE Transactions on Computers, C-18(8), 1969.Google Scholar
- Harary, F. Graph Theory. Addison-Wesley, Reading, Mass., 1969.Google Scholar