Latest YouTube Video

Thursday, June 4, 2015

Encoding Markov Logic Networks in Possibilistic Logic. (arXiv:1506.01432v1 [cs.AI])

Markov logic uses weighted formulas to compactly encode a probability distribution over possible worlds. Despite the use of logical formulas, Markov logic networks (MLNs) can be difficult to interpret, due to the often counter-intuitive meaning of their weights. To address this issue, we propose a method to construct a possibilistic logic theory that exactly captures what can be derived from a given MLN using maximum a posteriori (MAP) inference. Unfortunately, the size of this theory is exponential in general. We therefore also propose two methods which can derive compact theories that still capture MAP inference, but only for specific types of evidence. These theories can be used, among others, to make explicit the hidden assumptions underlying an MLN or to explain the predictions it makes.



from cs.AI updates on arXiv.org http://ift.tt/1RNDAMh
via IFTTT

No comments: