2.6. Further reading#

Many (but not all) aspects of Artificial Intelligence are amenable to logical analysis. An early advocate of this approach is Kowalski (1979). Overviews of different types of logics used in Artificial Intelligence can be found in (Turner, 1984; Genesereth & Nilsson, 1987; Ramsay, 1988). Bläsius and Bürckert (1989) discuss more technical aspects of automated theorem proving.

The main source for theoretical results in Logic Programming is (Lloyd, 1987). Hogger (1990) gives a more accessible introduction to this theory. (Mendelson, 1987) is an excellent introduction to Predicate Logic.

  • K.H. Bläsius & H.J. Bürckert (eds) (1989), Deduction Systems in Artificial Intelligence, Ellis Horwood.

  • M.R. Genesereth & N.J. Nilsson (1987), Logical Foundations of Artificial Intelligence, Morgan Kaufmann.

  • C.J. Hogger (1990), Essentials of Logic Programming, Oxford University Press.

  • R.A. Kowalski (1979), Logic for Problem Solving, North-Holland.

  • J.W. Lloyd (1987), Foundations of Logic Programming, Springer-Verlag, second edition.

  • E. Mendelson (1987), Introduction to Mathematical Logic, Wadsworth & Brooks/Cole, third edition.

  • R. Turner (1984), Logics for Artificial Intelligence, Ellis Horwood.

  • A. Ramsay (1988), Formal Methods in Artificial Intelligence, Cambridge University Press.