Challenges for action theories
Author(s)
Bibliographic Information
Challenges for action theories
(Lecture notes in computer science, 1775 . Lecture notes in artificial intelligence)
Springer, c2000
Available at 32 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
Note
Includes bibliographical references (p. [127]-134) and index
Description and Table of Contents
Description
A logic-based approach to the design of computing systems would, undoubtedly, offer many advantages over the imperative paradigm most commonly applied so far for programming and hardware design and, consequently, logic, again and again, has been heralded as the basis for the next generation of computer systems. While logic and formal methods are indeed gaining ground in many areas of computer science and artificial intelligence the expected revolution has not yet happened. In this book the author offers a convincing solution to the ramification problem and qualification problem associated with the frame problem and thus contributes to a satisfactory solution of the core problem and related challenges. Thielscher bases his approach on the fluent calculus, a first-order Prolog-like formalism allowing for the description of actions and change.
Table of Contents
Foundations of Action Theories.- The Ramification Problem.- The Qualification Problem.- Qualified Ramifications.
by "Nielsen BookData"