𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Reasoning with uncertainty in computer chess

✍ Scribed by Helmut Horacek


Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
1022 KB
Volume
43
Category
Article
ISSN
0004-3702

No coin nor oath required. For personal study only.

✦ Synopsis


This paper aims at an improvement of decision making under conditions of uncertainty. An overall analysis is given of how manifestations of uncertainty are dealt with in the field of computer chess. A new method of expressing uncertainty is presented which is done on the basis of a pair of point values associated with a weighting factor that indicates a preference between them. The reasoning process aiming at decisions among problem states associated with such a weighted pair is embedded in a traditional environment which requires point values. Essential components of this process are the overall (general) state of the critical position in terms of the degree of advantage and the competence of the system to judge the category of the domain-specific feature which causes the uncertainty. Finally, we present further improvements of the reasoning process which can be achieved when the requirement to back up point values is removed.


πŸ“œ SIMILAR VOLUMES


Extending description logics with uncert
✍ Guilin Qi; Qiu Ji; Jeff Z. Pan; Jianfeng Du πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 290 KB

Possibilistic logic provides a convenient tool for dealing with uncertainty and handling inconsistency. In this paper, we propose possibilistic description logics as an extension of description logics, which are a family of well-known ontology languages. We first give the syntax and semantics of pos

On proof- and model-based techniques for
✍ FlΓ‘vio S. CorrΔ›a da Silva πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 578 KB

In this article we compare two well-known techniques for reasoning with uncertainty-namely, Incidence Calculus and Fagin-Halpern's version of the Theory of Evidence-from a viewpoint not so frequently explored for such techniques. We argue that, despite the equivalence relations that these techniques

Toward a general theory of reasoning wit
✍ Ronald R. Yager πŸ“‚ Article πŸ“… 1986 πŸ› John Wiley and Sons 🌐 English βš– 902 KB

We describe the theories of approximate reasoning and mathematical evidence. We show that in the face of possibilistic uncertainty they lead to equivalent inferences. After appropriately extending the mathematical theory of evidence to the fuzzy environment we show that these two theories are equiva