In its first part, the book analyses symbolic computation involving probabilism from scratch. The book establishes rigorous Markov Chain semantics for the typed lambda calculus with recursion and probabilistic choices. It exploits statistical distributions as domains and defines appropriate denotational semantics for the introduced lambda calculus. It proofs important correspondence theorems between the established operational and denotational semantics. In the second part, we review the power of inductive logics as the foundation for expert reasoning systems.
- ISBN: 978-3-642-55197-0
- Editorial: Springer
- Encuadernacion: Cartoné
- Fecha Publicación: 09/05/2016
- Nº Volúmenes: 1
- Idioma: Inglés