Complex probabilistic modeling with recursive relational Bayesian networks
From MaRDI portal
Publication:2349799
DOI10.1023/A:1016713501153zbMath1314.68302MaRDI QIDQ2349799
Publication date: 17 June 2015
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Bayesian networks; relational models; temporal models; first-order probabilistic representations; knowledge-based model construction
68T30: Knowledge representation
68T37: Reasoning under uncertainty in the context of artificial intelligence
Related Items
New Advances in Logic-Based Probabilistic Modeling by PRISM, Model-Theoretic Expressivity Analysis, The complexity of Bayesian networks specified by propositional and relational languages, The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference, Deciding probabilistic simulation between probabilistic pushdown automata and finite-state systems, The finite model theory of Bayesian network specifications: descriptive complexity and zero/one laws, Probabilistic logic with independence, MEBN: a language for first-order Bayesian knowledge bases, Assembling a consistent set of sentences in relational probabilistic logic with stochastic independence, The effect of combination functions on the complexity of relational Bayesian networks, Compiling relational Bayesian networks for exact inference