Minimal Temporal Epistemic Logic

Notre Dame Journal of Formal Logic

Volumn 37, Issue 2, 1996, Pages 233-259

  Engelfriet, Joeri ^a  

^a VU UNIVERSITY AMSTERDAM   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85019717235     PISSN: 00294527     EISSN: 19390726     Source Type: Journal    
DOI: 10.1305/ndjfl/1040046088     Document Type: Article

References (21)

1. Alchourrón, C. E., P. Gärdenfors, and D. Makinson, “On the logic of theory change: partial meet contraction and revision functions,” The Journal of Symbolic Logic, vol. 50 (1985), pp. 510-530.
2. Andréka, H., J. van Benthem, and I. Németi, “Back and forth between modal logic and classical logic,” Institute for Language, Logic and Information, Report ML-95-04, Amsterdam, 1995. Forthcoming in: Bulletin of the Interest Group for Pure and Applied Logics.
3. de Bakker, J. W., W.-P. de Roever, and G. Rozenberg, Linear Time, Branching Time and Partial Orders in Logics and Models for Concurrency, Lecture Notes in Computer Science, vol. 354, Springer-Verlag, Berlin, 1989.
4. Donini, F. M., D. Nardi, and R. Rosati, “Ground nonmonotonic modal logics for knowledge representation,” pp. 133-144 in Proceedings of the Second World Congress on Fundamentals of Artificial Intelligence, W OCFAI-95, edited by M. De Glas and Z. Pawlak, Angkor, Paris, 1995. 4, 6.
5. Engelfriet, J., and J. Treur, “A temporal model theory for default logic,” pp. 91-96 in Proceedings of the 2nd European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty, ECSQARU’93, edited by M. Clarke, R. Kruse, and S. Moral, Lecture Notes in Computer Science, vol. 747, Springer-Verlag, Berlin, 1993.
6. Engelfriet, J., and J. Treur, “Temporal theories of reasoning,” pp. 279-299 in Logics in Artificial Intelligence, Proceedings of the 4th European Workshop on Logics in Artificial Intelligence, JELIA’94, edited by C. MacNish, D. Pearce, and L. M. Pereira, Lecture Notes in Artificial Intelligence, vol. 838, Springer-Verlag, Berlin, 1994.
7. Engelfriet, J., and J. Treur, “Specification of nonmonotonic reasoning,” pp. 111-125 in Practical Reasoning, Proceedings of the International Conference on Formal and Applied Practical Reasoning, FAPR’96, edited by D. M. Gabbay and H. J. Ohlbach, Lecture Notes in Artificial Intelligence, vol. 1085, Springer-Verlag, Berlin, 1996.
8. Finger, M., and D. M. Gabbay, “Adding a temporal dimension to a logic system,” Journal of Logic, Language and Information, vol. 1 (1992), pp. 203-233.
9. Gabbay, D. M., C. J. Hogger, and J. A. Robinson, Handbook of Logic in Artificial In-telligence and Logic Programming, vol. 3: Nonmonotonic Reasoning and Uncertain Reasoning, Oxford University Press, Oxford, 1994.
10. Goldblatt, R., Logics of Time and Computation, CSLI Lecture Notes, No. 7, Stanford University Press, Palo Alto, 1992.
11. Gottlob, G., “Complexity results for nonmonotonic logics,” Journal of Logic and Com-putation, vol. 2, (1992), pp. 397-425.
12. Halpern, J. Y., and Y. Moses, “Towards atheory of knowledge and ignorance,” pp. 125-143 in Proceedings of the Workshop on Non-monotonic Reasoning, AAAI Press, Menlo Park, 1984. 4, 4, 4, 8.
13. Halpern, J. Y., and Y Moses, “A guide to the modal logics of knowledge and belief,” pp. 480-490 in Proceedings of the 9th IJCAI, edited by A. Joshi, Kaufmann, Los Altos, 1985. 2, 1.
14. Johnson, D. S., “A catalog of complexity classes,” pp. 67-161 in Handbook of Theoretical Computer Science, vol. A: Algorithms and complexity, edited by J. van Leeuwen, Elsevier Science Publishers, Amsterdam, 1990.
15. Ladner, R. E., “The computational complexity of provability in systems of modal propositional logic,” SIAM Journal on Computing, vol. 6 (1977), pp. 467-480.
16. Meyer, J.-J. Ch., and W. van der Hoek, Epistemic Logic for Computer Science and Artificial Intelligence, Cambridge Tracts in Theoretical Computer Science, vol. 41, Cambridge University Press, Cambridge, 1995.
17. Papadimitriou, C. H., and M. Sideri, “On finding extensions of default theories,” pp. 276-281 in Proceedings of the 4th International Conference on Database Theory, ICDT-92, edited by J. Biskup and R. Hull, Lecture Notes in Computer Science, vol. 646, Springer-Verlag, Berlin, 1992. 6, 6.
18. Reiter, R., “A logic for default reasoning,” Artificial Intelligence, vol. 13 (1980), pp. 81132.
19. Sistla, A. P., and E. M. Clarke, “The complexity of propositional linear temporal logics,” Journal of the ACM, vol. 32 (1985), pp. 733-749.
20. Stillman, J., “The complexity of propositional default logics,” pp. 794-799 in Proceedings AAAI-92, edited by W. Swartout, AAAI Press, Menlo Park, 1992.
21. vanBenthem, J. F. A. K., “Semantic parallels in natural language and computation,” pp. 331-375 in Logic Colloquium, Granada 1987, edited by H. D. Ebbinghaus et al., North Holland, Amsterdam, 1989.