A recursive algorithm for computing inferences in imprecise Markov chains

DOI10.1007/978-3-030-29765-7_38OpenAlexW2973300812MaRDI QIDQ2297800

Thomas Krak, Natan T'Joens, Jasper De Bock, Gert De Cooman

Publication date: 20 February 2020

Full work available at URL: https://arxiv.org/abs/1905.12968

zbMATH Keywords

upper and lower expectationsimprecise Markov chainsrecursively decomposable inferences

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37)

Related Items (3)

Average behaviour in discrete-time imprecise Markov chains: a study of weak ergodicity ⋮ Game-theoretic upper expectations for discrete-time finite-state uncertain processes ⋮ Randomness is inherently imprecise

This page was built for publication: A recursive algorithm for computing inferences in imprecise Markov chains