A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
The Most Probable Explanation for Probabilistic Logic Programs with Annotated Disjunctions
[chapter]
2015
Lecture Notes in Computer Science
Probabilistic logic languages, such as ProbLog and CP-logic, are probabilistic generalizations of logic programming that allow one to model probability distributions over complex, structured domains. Their key probabilistic constructs are probabilistic facts and annotated disjunctions to represent binary and mutli-valued random variables, respectively. ProbLog allows the use of annotated disjunctions by translating them into probabilistic facts and rules. This encoding is tailored towards the
doi:10.1007/978-3-319-23708-4_10
fatcat:pw2kbf6yvnavhbbzglehmor6dm