As a guest user you are not logged in or recognized by your IP address. You have
access to the Front Matter, Abstracts, Author Index, Subject Index and the full
text of Open Access publications.
Markov logic is a robust approach for probabilistic relational knowledge representation that uses a log-linear model of weighted first-order formulas for probabilistic reasoning. This log-linear model always exists but may not represent the knowledge engineer's intentions adequately. In this paper, we develop a general framework for measuring this coherence of Markov logic networks by comparing the resulting probabilities in the model with the weights given to the formulas. Our measure takes the interdependence of different formulas into account and analyzes the degree of impact they have on the probabilities of other formulas. This approach can be used by the knowledge engineer in constructing a well-formed Markov logic network if data for learning is not available. We also apply our approach to the problem of assessing the compatibility of multiple Markov Logic networks, i. e., to measure to what extent the merging of these networks results in a change of probabilities.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.