Approximate reasoning in the algebra of bounded rational agents

DOI10.1016/J.IJAR.2006.09.014zbMath1191.68676OpenAlexW2074767038MaRDI QIDQ962635

Eugene Eberbach

Publication date: 7 April 2010

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ijar.2006.09.014

zbMATH Keywords

uncertaintydecision theoryprocess algebraapproximate reasoningproblem solvingbounded rational agents

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Agent technology and artificial intelligence (68T42)

Related Items (2)

On Completeness of Cost Metrics and Meta-Search Algorithms in $-Calculus ⋮ THE MYTH OF 'THE MYTH OF HYPERCOMPUTATION'

Cites Work

• A calculus of mobile processes. II
• Super-Recursive Algorithms
• Rough sets
• New Models of Computation
• Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
• Fuzzy sets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Approximate reasoning in the algebra of bounded rational agents