Skip to main content
Log in

Efficient reasoning about rich temporal domains

  • Published:
Journal of Philosophical Logic Aims and scope Submit manuscript

Abstract

We identify two pragmatic problems in temporal reasoning, the qualification problem and the extended prediction problem, the latter subsuming the infamous frame problem. Solutions to those seem to call for nonmonotonic inferences, and yet naive use of standard nonmonotonic logics turns out to be inappropriate.

Looking for an alternative, we first propose a uniform approach to constructing and understanding nonmonotonic logics. This framework subsumes many existing nonmonotonic formalisms, and yet is remarkably simple, adding almost no extra baggage to traditional logic.

We then use this framework to propose a solution to the qualification problem. We also outline a solution to the extended prediction problem, and speculate on a possible connection between the above discussion and the concept of causation.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. K.L. Clark. Negation as failure. In Logic and Databases, pages 293–322, Plenum Press, New York, 1978.

    Google Scholar 

  2. T. Dean. Temporal Imagery: An Approach to Reasoning about Time for Planning and Problem Solving. Ph.D. thesis, Yale University, Computer Science Department, 1986.

  3. J. Doyle. A truth maintenance system. Artificial Intelligence, 12:231–272, 1979.

    Google Scholar 

  4. D. W. Etherington. Reasoning with Incomplete Information: Investigations of Non-Monotonic Reasoning. PhD thesis, Computer Science Department, University of British Columbia, 1986.

  5. J. Halpern and Y. Moses. Towards a Theory of Knowledge and Ignorance: Preliminary Report. Technical Report RJ 4448 48136, IBM Research Laboratory, San Jose, October 1984.

    Google Scholar 

  6. S. Hanks and D. V. McDermott. Temporal Reasoning and Default Logics. Technical Report YALEU/CSD/RR 430, Yale University, October 1985.

  7. V. Lifschitz. Computing circumscription. In Proc. 9th IJCAI, August 1985.

  8. V. Lukaszewicz. Considerations on default logic. In Proceedings of the Workshop on Nonmonotonic Reasoning, pages 165–193, AAAI, 1984.

  9. D. A. McAllester. Reasoning Utility Package User's Manual. Technical Report 667, M.I.T. AI Lab Memo, 1982.

  10. J. M. McCarthy, Circumscription—a form of non monotonic reasoning. Artificial Intelligence, 13:27–39, 1980.

    Google Scholar 

  11. J. M. McCarthy and P. J. Hayes. Some philosopical problems from the standpoint of artificial intelligence. In Readings in Artificial Intelligence, pages 431–450, Tioga Publishing Co., Palo Alto, CA, 1981.

    Google Scholar 

  12. D. V. McDermott. Contexts and data dependencies: a synthesis. IEEE Trans. on Pattern Analysis and Machine Intelligence, 5(3):237–246, 1983.

    Google Scholar 

  13. D. V. McDermott. Nonmonotonic logic II: nonmonotonic modal theories. JACM, 29(1):33–57, 1982.

    Google Scholar 

  14. D. V. McDermott. A temporal logic for reasoning about processes and plans. Cognitive Science, 6:101–155, 1982.

    Google Scholar 

  15. D. V. McDermott and J. Doyle. Nonmonotonic Logic I. Artificial Intelligence, 13:41–72, 1980.

    Google Scholar 

  16. R. C. Moore. Semantical considerations on nonmonotonic logic. In Proc. 8th IJCAI, Germany, 1983.

  17. Z. W. Pylyshyn, editor. The Robot's Dilemma. Norwood, New Jersey, 1986.

  18. R. Reiter. A logic for default reasoning. Artificial Intelligence, 13:81–132, 1980.

    Google Scholar 

  19. Y. Shoham. Reasoning about Change. MIT Press, Boston, MA, 1987.

    Google Scholar 

  20. Y. Shoham and D. McDermott, Problems in temporal reasoning. Artificial Intelligence, to appear, 1988.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shoham, Y. Efficient reasoning about rich temporal domains. J Philos Logic 17, 443–474 (1988). https://doi.org/10.1007/BF00297513

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00297513

Keywords

Navigation