Computational tradeoffs under bounded resources
Artificial Intelligence - special issue on computational tradeoffs under bounded resources
Artificial Intelligence: A Modern Approach
Artificial Intelligence: A Modern Approach
Approximate reasoning in the algebra of bounded rational agents
International Journal of Approximate Reasoning
Hi-index | 0.00 |
The decision theory is defined typically as the combination of utility theory and probability theory. In this paper we generalize the decision theory as the performance measure theory and uncertainty theory. Intelligent agents look for approximate optimal decisions under bounded resources and uncertainty. The $-calculus process algebra for problem solving applies the cost performance measures to converge to optimal solutions with minimal problem solving costs, and allows to incorporate probabilities, fuzzy sets and rough sets to deal with uncertainty and incompleteness.