Complex probabilistic modeling with recursive relational Bayesian networks
From MaRDI portal
Publication:2349799
DOI10.1023/A:1016713501153zbMath1314.68302OpenAlexW1571067406MaRDI QIDQ2349799
Publication date: 17 June 2015
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1016713501153
Bayesian networksrelational modelstemporal modelsfirst-order probabilistic representationsknowledge-based model construction
Knowledge representation (68T30) Reasoning under uncertainty in the context of artificial intelligence (68T37)
Related Items (14)
Probabilistic logic with independence ⋮ Fine-tuning the odds in Bayesian networks ⋮ 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 ⋮ On the foundations of cycles in Bayesian networks ⋮ Model Checking Temporal Properties of Recursive Probabilistic Programs ⋮ The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference ⋮ The complexity of Bayesian networks specified by propositional and relational languages ⋮ Deciding probabilistic simulation between probabilistic pushdown automata and finite-state systems ⋮ Compiling relational Bayesian networks for exact inference ⋮ The finite model theory of Bayesian network specifications: descriptive complexity and zero/one laws ⋮ New Advances in Logic-Based Probabilistic Modeling by PRISM ⋮ Model-Theoretic Expressivity Analysis
This page was built for publication: Complex probabilistic modeling with recursive relational Bayesian networks