Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

Reasoning About Action and Change

Florence Dupin de Saint-Cyr, Andreas Herzig, Jérôme Lang, Pierre Marquis

TL;DR

This chapter presents the state of research concerning the formalisation of an agent reasoning about a dynamic system which can be partially observed and acted upon, and addresses a special case of progression, namely belief update.

Abstract

The purpose of this book is to provide an overview of AI research, ranging from basic work to interfaces and applications, with as much emphasis on results as on current issues. It is aimed at an audience of master students and Ph.D. students, and can be of interest as well for researchers and engineers who want to know more about AI. The book is split into three volumes.

Reasoning About Action and Change

TL;DR

This chapter presents the state of research concerning the formalisation of an agent reasoning about a dynamic system which can be partially observed and acted upon, and addresses a special case of progression, namely belief update.

Abstract

The purpose of this book is to provide an overview of AI research, ranging from basic work to interfaces and applications, with as much emphasis on results as on current issues. It is aimed at an audience of master students and Ph.D. students, and can be of interest as well for researchers and engineers who want to know more about AI. The book is split into three volumes.
Paper Structure (16 sections, 1 theorem, 9 equations, 1 figure)

This paper contains 16 sections, 1 theorem, 9 equations, 1 figure.

Table of Contents

  1. Introduction
  2. Reasoning about Action: Models
  3. Basic Concepts and the Corresponding Models
  4. Types of Reasoning and their Implementations
  5. Prediction and Postdiction with Ontic Actions
  6. Prediction and Postdiction with Epistemic Actions
  7. Event Abduction
  8. Scenario Extrapolation
  9. Reasoning about Action: Languages
  10. Problems related to the Representation of Actions
  11. The Situation Calculus
  12. Propositional Action Languages
  13. Dynamic Logic
  14. Dynamic Bayesian Networks
  15. Reasoning about Change: Update
  16. ...and 1 more sections

Key Result

Theorem 1

$\diamond$ satisfies U1, U2, U3, U4, U5, U8, U9If U6 and U7 are used instead of U9 then the theorem gives us a faithful preorder that is only partial. if and only if for every $\omega \in \Omega$ there is a total preorder $\leq_{\omega}$ such that

Figures (1)

  • Figure 1: The DAG of a dynamic Bayesian network

Theorems & Definitions (1)

  • Theorem 1: Katsuno, Mendelzon