Skip to main content
SpringerLink
Log in

Challenges for Action Theories

  • Book
  • © 2000

Overview

Authors:
  1. Michael Thielscher

    1. Computational Logic, Technische Universität Dresden Informatik, Dresden, Germany

    View author publications

    You can also search for this author in PubMed   Google Scholar

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

Part of the book sub series: Lecture Notes in Artificial Intelligence (LNAI)

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

Access this book

Log in via an institution
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

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (4 chapters)

  1. Front Matter

    Pages I-XIV
    Download chapter PDF

  2. Foundations of Action Theories

    Pages 1-15

  3. The Ramification Problem

    Pages 17-83

  4. The Qualification Problem

    Pages 85-118

  5. Qualified Ramifications

    Pages 119-124

  6. Back Matter

    Pages 125-138
    Download chapter PDF
Back to top

Keywords

About this book

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.

Authors and Affiliations

  • Computational Logic, Technische Universität Dresden Informatik, Dresden, Germany

    Michael Thielscher

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation