Markov logic networks combine Markov networks with first-order logic in a probabilistic framework (Richardson and Domingos, 2006) where φ i is a first order formula and w i is the penalty (the formula's weight).
to the first-order logic, whereby a formula represents a hard constraint, these logic formulas are relaxed and can be violated with penalties in the MLN.