Handbook of Defeasible Reasoning and Uncertainty Management Systems: Algorithms for Uncertainty and Defeasible Reasoning

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

Reasoning under uncertainty is always based on a specified language or for­ malism, including its particular syntax and semantics, but also on its associated inference mechanism. In the present volume of the handbook the last aspect, the algorithmic aspects of uncertainty calculi are presented. Theory has suffi­ ciently advanced to unfold some generally applicable fundamental structures and methods. On the other hand, particular features of specific formalisms and ap­ proaches to uncertainty of course still influence strongly the computational meth­ ods to be used. Both general as well as specific methods are included in this volume. Broadly speaking, symbolic or logical approaches to uncertainty and nu­ merical approaches are often distinguished. Although this distinction is somewhat misleading, it is used as a means to structure the present volume. This is even to some degree reflected in the two first chapters, which treat fundamental, general methods of computation in systems designed to represent uncertainty. It has been noted early by Shenoy and Shafer, that computations in different domains have an underlying common structure. Essentially pieces of knowledge or information are to be combined together and then focused on some particular question or domain. This can be captured in an algebraic structure called valuation algebra which is described in the first chapter. Here the basic operations of combination and focus­ ing (marginalization) of knowledge and information is modeled abstractly subject to simple axioms.

Author(s): Jürg Kohlas, Serafín Moral (auth.), Jürg Kohlas, Serafín Moral (eds.)
Series: Handbook of Defeasible Reasoning and Uncertainty Management Systems 5
Edition: 1
Publisher: Springer Netherlands
Year: 2000

Language: English
Pages: 517
Tags: Logic; Artificial Intelligence (incl. Robotics); Mathematical Logic and Foundations

Front Matter....Pages i-v
Introduction....Pages 1-4
Computation in Valuation Algebras....Pages 5-39
Consequence Finding Algorithms....Pages 41-145
Computing Specificity in Default Reasoning....Pages 147-177
Possibilistic Logic: Complexity and Algorithms....Pages 179-220
Probabilistic Argumentation Systems....Pages 221-288
Probabilistic Networks....Pages 289-320
Probabilistic Satisfiability....Pages 321-367
Algorithms for Imprecise Probabilities....Pages 369-420
Algorithms for Dempster-Shafer Theory....Pages 421-475
Network-Based Decision Algorithms....Pages 477-510
Back Matter....Pages 511-517