Difference between revisions of "Markov Logic Networks"
| Line 3: | Line 3: | ||
== Definition == | == Definition == | ||
| − | A Markov Logic Network ''L'' is a set of pairs | + | A Markov Logic Network '''L''' is a set of pairs <math>(F_{i}, w_{i})</math> where ''F<sub>i</sub>'' is a formula in first-order logic and w<sub>i</sub> is a real number. Given ''C'' is a finite set of constants ''{c<sub>1</sub>, c<sub>2</sub>, ...}'', ''L'' defines together with ''C'' a Markov Network ''M<sub>L, C</sub>'': |
* ''M<sub>L, C</sub>'' contains one binary node for each possible grounding of each predicate in ''L''. If the ground atom is true, the value of the node is 1, and 0 otherwise. | * ''M<sub>L, C</sub>'' contains one binary node for each possible grounding of each predicate in ''L''. If the ground atom is true, the value of the node is 1, and 0 otherwise. | ||
Revision as of 07:06, 27 September 2011
This is a method that combines first-order logic and probabilistic graphical models. In first-order logic, a set of formulas represent hard constraints over a set of instances, and if an instance violates one of them, it has zero probability. The basic idea of a Markov Logic Network (MLN) is to generalize first-order logic by softening those hard constraints, assigning a real number (the weight) to each formula to indicate how hard it is, so that an instance that violates one or more formulas is not impossible anymore, just less probable.
Definition
A Markov Logic Network L is a set of pairs where Fi is a formula in first-order logic and wi is a real number. Given C is a finite set of constants {c1, c2, ...}, L defines together with C a Markov Network ML, C:
- ML, C contains one binary node for each possible grounding of each predicate in L. If the ground atom is true, the value of the node is 1, and 0 otherwise.
- ML, C contains one binary node for each possible grounding of each predicate in L. If the ground atom is true, the value of the node is 1, and 0 otherwise.
