Notre Dame Journal of Formal Logic

Minimal Temporal Epistemic Logic

Joeri Engelfriet

Abstract

In the study of nonmonotonic reasoning the main emphasis has been on static (declarative) aspects. Only recently has there been interest in the dynamic aspects of reasoning processes, particularly in artificial intelligence. We study the dynamics of reasoning processes by using a temporal logic to specify them and to reason about their properties, just as is common in theoretical computer science. This logic is composed of a base temporal epistemic logic with a preference relation on models, and an associated nonmonotonic inference relation, in the style of Shoham, to account for the nonmonotonicity. We present an axiomatic proof system for the base logic and study decidability and complexity for both the base logic and the nonmonotonic inference relation based on it. Then we look at an interesting class of formulas, prove a representation result for it, and provide a link with the rule of monotonicity.

Article information

Source
Notre Dame J. Formal Logic, Volume 37, Number 2 (1996), 233-259.

Dates
First available in Project Euclid: 16 December 2002

Permanent link to this document
https://projecteuclid.org/euclid.ndjfl/1040046088

Digital Object Identifier
doi:10.1305/ndjfl/1040046088

Mathematical Reviews number (MathSciNet)
MR1403819

Zentralblatt MATH identifier
0866.03014

Subjects
Primary: 03B60: Other nonclassical logic
Secondary: 68T27: Logic in artificial intelligence

Citation

Engelfriet, Joeri. Minimal Temporal Epistemic Logic. Notre Dame J. Formal Logic 37 (1996), no. 2, 233--259. doi:10.1305/ndjfl/1040046088. https://projecteuclid.org/euclid.ndjfl/1040046088


Export citation

References

  • 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. Zbl 0578.03011 MR 87c:03020
  • 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. Zbl 0840.03010 MR 96k:03036
  • 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. Zbl 0683.68001 MR 90i:68009
  • 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,WOCFAI-95, edited by M. De Glas and Z. Pawlak, Angkor, Paris, 1995.
  • 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. MR 95e:03092
  • 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. MR 1320729
  • 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. MR 1457030
  • 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. Zbl 0798.03031 MR 95h:03037
  • Gabbay, D. M., C. J. Hogger, and J. A. Robinson, Handbook of Logic in Artificial Intelligence and Logic Programming, vol. 3: Nonmonotonic Reasoning and Uncertain Reasoning, Oxford University Press, Oxford, 1994. Zbl 0804.03017 MR 95b:03003
  • Goldblatt, R., Logics of Time and Computation, CSLI Lecture Notes, No. 7, Stanford University Press, Palo Alto, 1992. Zbl 0635.03024 MR 88k:03058
  • Gottlob, G., “Complexity results for nonmonotonic logics,” Journal of Logic and Computation, vol. 2, (1992), pp. 397–425. Zbl 0765.03012 MR 93i:03034
  • Halpern, J. Y., and Y. Moses, “Towards a theory of knowledge and ignorance,” pp. 125–143 in Proceedings of the Workshop on Non-monotonic Reasoning, AAAI Press, Menlo Park, 1984.
  • 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.
  • 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. Zbl 0900.68246 MR 1127168
  • Ladner, R. E., “The computational complexity of provability in systems of modal propositional logic,” SIAM Journal on Computing, vol. 6 (1977), pp. 467–480. Zbl 0373.02025 MR 56:8326
  • 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. Zbl 0868.03001 MR 96m:68166
  • 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.
  • Reiter, R., “A logic for default reasoning,” Artificial Intelligence, vol. 13 (1980), pp. 81–132. Zbl 0435.68069 MR 83e:68138
  • Sistla, A. P., and E. M. Clarke, “The complexity of propositional linear temporal logics,” Journal of the ACM, vol. 32 (1985), pp. 733–749. Zbl 0632.68034 MR 87j:68077
  • Stillman, J., “The complexity of propositional default logics,” pp. 794 –799 in Proceedings AAAI-92, edited by W. Swartout, AAAI Press, Menlo Park, 1992. MR 93k:68089
  • van Benthem, 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. Zbl 0694.03022 MR 91k:03075