The complexity of inferences and explanations in probabilistic logic programming

DOI10.1007/978-3-319-61581-3_40MaRDI QIDQ2401894zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Fabio G. Cozman, D. D. Maua

Publication date 5 September 2017

Full work available at URL https://doi.org/10.1007/978-3-319-61581-3_40

Mathematics Subject Classification ID

Logic programming (68N17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Recommendations

• On the semantics and complexity of probabilistic logic programs
• Complexity results for probabilistic answer set programming
• Probabilistic logic programming with conditional constraints
• MAP inference for probabilistic logic programming
• Inference in probabilistic logic programs using lifted explanations

Cited in

(11)

• The complexity of Bayesian networks specified by propositional and relational languages
• On the complexity of inference about probabilistic relational models
• Explanations as programs in probabilistic logic programming
• Complexity results for probabilistic answer set programming
• Complexity Results for Probabilistic Datalog
• MAP inference for probabilistic logic programming
• Inference in probabilistic logic programs using lifted explanations
• On the semantics and complexity of probabilistic logic programs
• An Asymptotic Analysis of Probabilistic Logic Programming, with Implications for Expressing Projective Families of Distributions
• Languages for probabilistic modeling over structured and relational domains
• Probabilistic (logic) programming concepts

This page was built for publication: The complexity of inferences and explanations in probabilistic logic programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2401894)