Logics of Knowledge, Games and Dynamic Logic

We study monotonic and non-monotonic Logics of Knowledge, giving decision procedures and completeness results. In particular we develop a model theory for a non-monotonic Logic of Knowledge and show that it corresponds exactly to normal applications of a non-monotonic rule of inference due to Mccarthy.

[1]  John McCarthy,et al.  SOME PHILOSOPHICAL PROBLEMS FROM THE STANDPOINT OF ARTI CIAL INTELLIGENCE , 1987 .

[2]  Daniel Lehmann,et al.  Knowledge, common knowledge and related puzzles (Extended Summary) , 1984, PODC '84.

[3]  Raymond Reiter.  On Closed World Data Bases , 1977, Logic and Data Bases.

[4]  William P. Alston,et al.  Knowledge and the Flow of Information , 1985 .

[5]  Rohit Parikh,et al.  An Elementary Proof of the Completness of PDL , 1981, Theor. Comput. Sci..

[6]  W. Richard Stark.  A Logic of Knowledge , 1981, Math. Log. Q..

[7]  Vaughan R. Pratt,et al.  Models of program logics , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[8]  Rohit Parikh,et al.  Propositional game logic , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[9]  Rohit Parikh,et al.  The Completeness of Propositional Dynamic Logic , 1978, MFCS.

[10]  Robert C. Moore.  Semantical Considerations on Nonmonotonic Logic , 1985, IJCAI.

[11]  Drew McDermott,et al.  Non-Monotonic Logic I , 1987, Artif. Intell..

[12]  J. Hintikka.  Knowledge and belief , 1962 .