REASONING WITH UNCERTAINTY IN COMPUTER CHESS

被引:6
|
作者
HORACEK, H
机构
[1] Universität Bielefeld, Fakultät für Linguistik und Literaturwissenschaft, D-4800 Bielefeld 1
关键词
D O I
10.1016/0004-3702(90)90069-C
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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. © 1990.
引用
收藏
页码:37 / 56
页数:20
相关论文
共 50 条