Abstract
The $-calculus cognitive process algebra for problem solving provides the support for automatic problem solving and targets intractable and undecidable problems. Consistent with the ideas of anytime algorithms, $-calculus applies the cost performance measures to converge to optimal solutions with minimal problem solving costs. In the paper, we concentrate on a uniform problem solving and its implementation aspects illustrated on two benchmarks from concurrency and machine learning areas.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ansari, B.: $-cala: An Embedded Programming Language Based on $-Calculus and Scala, Master Thesis, Rensselaer Polytechnic Institute at Hartford (2013)
Cremet, V., Odersky, M.: PiLib: A Hosted Language for Pi-Calculus Style Concurrency. In: Lengauer, C., Batory, D., Blum, A., Odersky, M. (eds.) Domain-Specific Program Generation. LNCS, vol. 3016, pp. 180–195. Springer, Heidelberg (2004)
Eberbach, E.: $-Calculus of Bounded Rational Agents: Flexible Optimization as Search under Bounded Resources in Interactive Systems. Fundamenta Informaticae 68(1-2), 47–102 (2005)
Eberbach, E.: The $-Calculus Process Algebra for Problem Solving: A Paradigmatic Shift in Handling Hard Computational Problems. Theoretical Computer Science 383(2-3), 200–243 (2007), doi:dx.doi.org/10.1016/j.tcs.2007.04.012
Eberbach, E.: Approximate Reasoning in the Algebra of Bounded Rational Agents. Intern. Journal of Approximate Reasoning 49(2), 316–330 (2006), doi:dx.doi.org/10.1016/j.ijar.2006.09.014
Horvitz, E., Zilberstein, S.: Computational Tradeoffs under Bounded Resources. Artificial Intelligence 126, 1–196 (2001)
Milner, R., Parrow, J., Walker, D.: A Calculus of Mobile Processes, I & II. Information and Computation 100, 1–77 (1992)
Russell, S., Norvig, P.: Artificial Intelligence: A Modern Approach, 3rd edn. Prentice-Hall (1995) (2010)
Smith, J.: $-Calculisp: an Implementation of $-Calculus Process Algebra in Common Lisp. Master Project, Rensselaer Polytechnic Institute at Hartford (2013)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Eberbach, E. (2014). A Uniform Problem Solving in the Cognitive Algebra of Bounded Rational Agents. In: Jezic, G., Kusek, M., Lovrek, I., J. Howlett, R., Jain, L. (eds) Agent and Multi-Agent Systems: Technologies and Applications. Advances in Intelligent Systems and Computing, vol 296. Springer, Cham. https://doi.org/10.1007/978-3-319-07650-8_13
Download citation
DOI: https://doi.org/10.1007/978-3-319-07650-8_13
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-07649-2
Online ISBN: 978-3-319-07650-8
eBook Packages: EngineeringEngineering (R0)