## Challenges for Action Theories, Issue 1775A 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. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

1 Foundations of Action Theories | 1 |

2 The Ramification Problem | 16 |

3 The Qualification Problem | 85 |

4 Qualified Ramifications | 119 |

Acknowledgments | 125 |

126 | |

135 | |

### Other editions - View all

### Common terms and phrases

abnormal disqualification abnormality fluents AC1N Action Description Language action disqualifications action laws action name action sequences action theory applicable axiomatization axioms causal relationships causal successor causes light classical logic conjunction consistent constraints Default Logic default theory defined Definition denote depicted in Fig disq(a disq(ignite down(x Elaser electric circuit encoding engine-problem entails EUNA Event Calculus example first-order logic Fluent Calculus fluent formula fluent literals fluent names formal Frame Problem global minimization hence ignite implies in(pt in(x indirect effects influence information instance interpretation light bulb low-battery minimizing-change successor nonmonotonic notion observation obtained occur potato preconditions preliminary successor qualification domain Qualification Problem qualification scenario Ramification Problem reason Res(a result satisfies set of causal set of fluent sets of entities Situation Calculus specification state-effect pair Suppose switch s1 tail pipe tank-empty tion toggle(s1 toggle(x toggling transforms up(x transition model triggering effect up(lhs up(rhs up(s