Advertisement

Abstract

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.

Keywords

Graph Isomorphism Goal Structure Phrase Structure Grammar Generalise Cylinder Transformation Grammar 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Hintikka, J. Logic, language games and information: Kantian themes in the philosophy of logic. Clarendon Press, Oxford, 1973.MATHGoogle Scholar
  2. Cohen, P.R. and Feigenbaum, E.A. (editors). The Handbook of Artificial Intelligence, Volume 3. Pitman, London, 1982.MATHGoogle Scholar
  3. Marr, D. Analysis of occluding contour. Proc. Roy. Soc. London, B197:441–475, 1977.Google Scholar
  4. Gazdar, G., Klein, E., Pullum, F. and Sag, I. Generalised Phrase Structure Grammar. Blackwell, Oxford, 1985Google Scholar
  5. 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
  6. Weiss, S.M., Kulikowski, C.A., Amarel, S. and Safir, A. A model based method for computer-aided medical decision making. Artificial Intelligence, 11:145–172, 1978CrossRefGoogle Scholar
  7. Fikes, R.E. Knowledge Representation in Automatic Planning Systems. Technical Note 119, SRI, Menlo Park, California.Google Scholar
  8. Tate, A. Using Goal Structure to direct search in a Problem Solver. PhD thesis, MIRU, Edinburgh, 1975.Google Scholar
  9. Golay, M.J.E. Hexagonal parallel pattern transformations. IEEE Transactions on Computers, C-18(8), 1969.Google Scholar
  10. Draper, S.W. The use of gradient space and dual Space in line drawing Interpretation. Artificial Intelligence, 17:461–508, 1981.CrossRefGoogle Scholar
  11. Harary, F. Graph Theory. Addison-Wesley, Reading, Mass., 1969.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Alan Bundy
    • 1
  1. 1.Department of Artificial IntelligenceUniversity of EdinburghEdinburghScotland, UK

Personalised recommendations