Skip to main content

The Ramification Problem

  • Chapter
  • First Online:
Challenges for Action Theories

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1775))

  • 186 Accesses

Abstract

An invaluable advantage of action laws is that they allow to describe actions by their effects rather than by an exhaustive state transition table. However, the sole use of action laws quickly becomes unmanageable in complex domains, too. For action laws as they stand are supposed to be complete in that they specify the entire effect of an action. Yet although there are good reasons to assume that an action causes only a small number of direct changes, these in turn may initiate a long chain of indirect effects. Recall the action of toggling a switch, which, in the first place, causes nothing but a change of the switch’s position. However, the switch may be part of an electric circuit so that, say, some light bulb is turned off as a side effect, which in turn may cause someone to hurt himself in a suddenly darkened room by running against a chair that, as a consequence, falls into a television set whose implosion activates the fire alarm and so on and so forth.1

A crucial question in this context concerns the distinction between indirect effects occurring during a single world’s state transition step and those which deserve separate state transitions (also called “delayed” effects). E.g., the above may not only be described as “the fire alarm is activated in the successor state after having closed the switch,” but also as, say, “the chair is falling in the successor state (and presumably hits the television set during the next state transition).” As a reasonable, albeit informal, guidance we suggest a single state transition should summarize what happens until some agent has the possibility to intervene by acting again (stopping the chair from falling, for instance). See also Section 2.7 for a discussion on indirect vs. delayed effects.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

(2000). The Ramification Problem. In: Challenges for Action Theories. Lecture Notes in Computer Science(), vol 1775. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45596-5_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-45596-5_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67455-9

  • Online ISBN: 978-3-540-45596-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics