A hybrid approach to reasoning under uncertainty
β Scribed by Bruce D'Ambrosio
- Publisher
- Elsevier Science
- Year
- 1988
- Tongue
- English
- Weight
- 837 KB
- Volume
- 2
- Category
- Article
- ISSN
- 0888-613X
No coin nor oath required. For personal study only.
β¦ Synopsis
A complete approach to reasoning under uncertainty requires support for both identification of the appropriate hypothesis space and ranking hypotheses based on available evidence. We present a hybrid reasoning scheme that combines symbolic and numerical methods for uncertainty management to provide efficient and effective support for both of these tasks. The hybrid is based on symbolic techniques adapted from assumption-based truth maintenance systems (ATMS), combined with numerical methods adapted from the Dempster/Shafer theory of evidence, as extended in Baldwin's Support Logic Programming system. The hybridization is achieved by viewing an A TMS as a symbolic" algebra system for uncertainty calculations. This technique has several major advantages over conventional methods for performing inference with numerical certainty estimates in addition to the ability to dynamically determine hypothesis spaces, including improved management of dependent and partially independent evidence, faster run-time evaluation of propositional certainties, and the ability to query the certainty value of a proposition from multiple perspectives.
π SIMILAR VOLUMES
A multi-sensor decision fusion scheme is presented in which the probabilities associated with the local sensor decisions are known to vary in a nonrandom fashion around their design values. The uncertainties associated with the local decisions are modeled by means of fuzzy sets. A Bayesian approach
A fuzzy compromise approach to decision analysis is described within the context of water resource systems planning under uncertainty. The approach allows various sources of uncertainty and is intended to provide a exible form of group decision support. The example compares the ELECTRE method with t
We present a formalism, Disjunctive Linear Relations (DLRs), for reasoning about temporal constraints. DLRs subsume most of the formalisms for temporal constraint reasoning proposed in the literature and is therefore computationally expensive. We also present a restricted type of DLRs, Horn DLRs, wh