๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The Qualification Problem: A solution to the problem of anomalous models

โœ Scribed by Michael Thielscher


Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
284 KB
Volume
131
Category
Article
ISSN
0004-3702

No coin nor oath required. For personal study only.

โœฆ Synopsis


Intelligent agents in open environments inevitably face the Qualification Problem: The executability of an action can never be predicted with absolute certainty; unexpected circumstances, albeit unlikely, may at any time prevent the successful performance of an action. Reasoning agents in real-world environments rely on a solution to the Qualification Problem in order to make useful predictions but also to explain and recover from unexpected action failures. Yet the main theoretical result known today in this context is a negative one: While a solution to the Qualification Problem requires to assume away by default abnormal qualifications of actions, straightforward minimization of abnormality falls prey to the production of anomalous models. We present an approach to the Qualification Problem which resolves this anomaly. Anomalous models are shown to arise from ignoring causality, and they are avoided by appealing to just this concept. Our theory builds on the established predicate logic formalism of the Fluent Calculus as a solution to the Frame Problem and to the Ramification Problem in reasoning about actions. The monotonic Fluent Calculus is enhanced by a default theory in order to obtain the nonmonotonic approach called for by the Qualification Problem. The approach has been implemented in an action programming language based on the Fluent Calculus and successfully applied to the high-level control of robots.


๐Ÿ“œ SIMILAR VOLUMES


A natural solution to the ฮผ problem
โœ J.A. Casas; C. Muรฑoz ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 533 KB
A new solution to the identification pro
โœ Abduladhem Abdulkareem; R. Nagarajan ๐Ÿ“‚ Article ๐Ÿ“… 1983 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 208 KB

A new parameter identification scheme for SISO discretetime plants is proposed. The scheme has a set of high-speed relays introduced with an objective to reduce on-line computational complexity. The stability of the scheme is ensured by hyperstability criteria. The proposed scheme is extended to MIM

The solution to a matroid problem of Knu
โœ Robert E. Bixby ๐Ÿ“‚ Article ๐Ÿ“… 1978 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 167 KB

In thig ncrte we answer a question posed by Knuth in his recent paper "Random matroids". E"rtrutb des&.xs in [2] an algorithm which, subject to certain arbitrary choices, is ~&D&C of constructing any matroid. In effect, this algorithm shows how to ob~ai$d '"erectians? (as defined by Crapo [l]) of a