Skip to main content

Monotonic Solution of The Frame Problem in The Situation Calculus

An Efficient Method for Worlds with Fully Specified Actions

  • Chapter

Part of the book series: Studies in Cognitive Systems ((COGS,volume 5))

Abstract

The frame problem originally surfaced within McCarthy’s Situation Calculus [McCarthy68], when [McCarthy&Hayes69] applied it to reasoning about goal achievement. To illustrate their approach, they considered the problem of initiating a telephone conversation. They began by writing down plausible axioms which seemed to characterize the preconditions and effects of looking up a person’s telephone number and dialling that number. However, they found that they were still unable to prove that the plan “look up the number and dial it” would work, even if all the initial conditions were right (i.e., that the caller had a telephone and a telephone book, that the intended party was home, etc.). For example, the axioms provided no assurance that looking up the number would not make the caller’s telephone disappear, thus voiding a precondition for dialling.

“One feels that there should be some economical and principled way of succinctly saying what changes an action makes, without having to explicitly list all the things it doesn’t change as well; yet there doesn’t seem to be any other way to do it. That is the frame problem.”

Pat Hayes [Hayes87; p. 125]

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  • Allen, J. F. “Towards a general theory of action and time,” Artificial Intelligence 23, 1984.

    Google Scholar 

  • Bacchus, F. “Statistically founded degrees of belief,” Proceedings of the Seventh Biennial Conference of the Canadian Society for Computational Studies of Intelligence (CSCSI ‘88), June 6–10, Edmonton, Alberta 1988.

    Google Scholar 

  • Brown, F. M., ed. The Frame Problem in Artificial Intelligence, Morgan Kaufmann, 1987.

    Google Scholar 

  • Dean, J. and K. Kanazawa. “Probabilistic Causal Reasoning,” Proceedings of the Seventh Biennial Conference of the Canadian Society for Computational Studies of Intelligence (CSCSI ‘88), June 610, Edmonton, Alberta 1988.

    Google Scholar 

  • Fikes, R. E. and N. J. Nilsson. “STRIPS: A new approach to the application of theorem-proving to problem-solving,” Proceedings of the Second International Joint Conference on AI (IJCAI ‘71), Morgan Kaufmann, 1971.

    Google Scholar 

  • Fodor, J. A. “Modules, frames, fridgeons, sleeping dogs, and the music of the spheres,” The Robot’s Dilemma: The Frame Problem in Artificial Intelligence, Pylyshyn, Z. W., ed., Ablex, 1987.

    Google Scholar 

  • Georgeff, M. P. and A. M. Lansky. Reasoning about Actions and Plans, Morgan Kaufmann, 1987.

    Google Scholar 

  • Georgeff, M. P. “Actions, processes, causality,” Reasoning about Actions and Plans, Georgeff, M. P. and A. M. Lansky, eds., Morgan Kaufmann, 1987.

    Google Scholar 

  • Green, C. “Application of theorem proving to problem solving,” Proceedings of the International Joint Conference on AI (IJCAI ‘69), Morgan Kaufmann, 1969.

    Google Scholar 

  • Haas, A. R. “The case for domain-specific frame axioms,” The Frame Problem in Artificial Intelligence, Brown, F. M., ed., Morgan Kaufmann, 1987.

    Google Scholar 

  • Hanks, S. and D. McDermott. “Nonmonotonic logic and temporal projection,” Artificial Intelligence 33, 1987.

    Google Scholar 

  • Hayes, P. J., “What the frame problem is and isn’t,” The Robot’s Dilemma: The Frame Problem in Artificial Intelligence, Pylyshyn, Z. W., ed., Ablex Publishing Corp., 1987.

    Google Scholar 

  • Kowalski, R. A. “Logic for Problem Solving,” Artificial Intelligence Series 7, Elsevier, 1979.

    Google Scholar 

  • Kowalski, R. A. “Database updates in the event calculus,” Dept. of Computing, Imperial College, July, DOC 86/12, London, England, 1986.

    Google Scholar 

  • Kowalski, R. A. and M. J. Sergot. “A logic-based calculus of events,” New Generation Computing 4, 1986.

    Google Scholar 

  • Kyburg, H. “Probabilistic inference and probabilistic reasoning,” Proceedings of The Fourth Workshop on Uncertainty in AI, Philadelphia, PA, 1988.

    Google Scholar 

  • Lansky, A. L. “A representation of parallel activity based on events, structure, and causality,” Reasoning about Actions and Plans, Georgeff, M. P. and A. M. Lansky, eds., Morgan Kaufmann, 1987.

    Google Scholar 

  • Lifschitz, V. “Formal theories of action,” The Frame Problem in Artificial Intelligence, Brown, F. M., ed., Morgan Kaufmann, 1987.

    Google Scholar 

  • Manna, Z. and R. Waldinger. “A theory of plans,” Reasoning about Actions and Plans, Georgeff, M. P. and A. M. Lansky, eds., Morgan Kaufmann, 1987.

    Google Scholar 

  • McCarthy, J. “Programs with common sense,” Semantic Information Processing, M. Minsky, MIT Press, 1968.

    Google Scholar 

  • McCarthy, J. “First-order theories of individual concepts and propositions,” Machine Intelligence 9, D. Michie, ed., Edinburgh University Press, 1979.

    Google Scholar 

  • McCarthy, J. “Circumscription— a form of non-monotonic reasoning,” Artificial Intelligence 13, 1980.

    Google Scholar 

  • McCarthy, J. “Applications of circumscription to formalizing commonsense knowledge,” Proceedings of the Nonmonotonic Reasoning Workshop, New Paltz, NY Oct. 17–19, 1986.

    Google Scholar 

  • McCarthy, J. and P. J. Hayes. “Some philiosophical problems from the standpoint of artificial intelligence, ” Machine Intelligence 4, B. Meltzer and D. Michie, eds., Edinburgh University Press, 1969.

    Google Scholar 

  • McDermott, D., “A temporal logic for reasoning about processes and plans,” Cognitive Science 6, 1982.

    Google Scholar 

  • Pearl, J. Probabilistic Reasoning in Intelligent Systems, Morgan Kaufmann, 1988.

    Google Scholar 

  • Pylyshyn, Z. W. The Robot’s Dilemma: The Frame Problem in Artificial Intelligence, Ablex, 1987.

    Google Scholar 

  • Raphael, B. “The frame problem in problem solving systems,” Artificial Intelligence and Heuristic Programming, N. V. Findler and B. Meltzer, eds., Edinburgh, 1971.

    Google Scholar 

  • Reiter, R. “A logic for default reasoning,” Artificial Intelligence 13, 1980.

    Google Scholar 

  • Schank, R. C. and R. P. Abelson. Scripts, Plans, Goals and Understanding, Erlbaum, 1977.

    Google Scholar 

  • Weber, J. “Statistical inference and causal reasoning,” Proceedings Eleventh International Joint Conference on AI (IJCAI ‘89), Morgan Kaufmann, 1989.

    Google Scholar 

Download references

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Kluwer Academic Publishers

About this chapter

Cite this chapter

Schubert, L. (1990). Monotonic Solution of The Frame Problem in The Situation Calculus. In: Kyburg, H.E., Loui, R.P., Carlson, G.N. (eds) Knowledge Representation and Defeasible Reasoning. Studies in Cognitive Systems, vol 5. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-0553-5_2

Download citation

  • DOI: https://doi.org/10.1007/978-94-009-0553-5_2

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-010-6736-2

  • Online ISBN: 978-94-009-0553-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics