We look at probabilistic logic programs as a specification language for probabilistic models, and study their interpretation and complexity. Acyclic programs specify Bayesian networks, and, depending on constraints on logical atoms, their inferential complexity reaches complexity classes #P, #NP, and even #EXP. We also investigate (cyclic) stratified probabilistic logic programs, showing that they have the same complexity as acyclic probabilistic logic programs, and that they can be depicted using chain graphs.
|Número de páginas||13|
|Publicación||Journal of Machine Learning Research|
|Estado||Publicada - 2016|
|Publicado de forma externa||Sí|
|Evento||8th International Conference on Probabilistic Graphical Models, PGM 2016 - Lugano, Suiza|
Duración: 6 sep 2016 → 9 sep 2016