Markov Logic

A Markov Logic is a formal logic that attaches weights to first-order formulas.

• Context:
  • It can define a Markov Logic Network Family (of Markov logic networks).
  • …
• Counter-Example(s):
  • a Bayesian Logic.
  • a First-order Logic.
• See: Markov Logic Software System, Graph-based Knowledge Representation System.

---

---

References

2009

• (Domingos & Lowd, 2009) ⇒ Pedro Domingos, and Daniel Lowd. (2009). “Markov Logic: An Interface Layer for Artificial Intelligence." Morgan & Claypool. doi:10.2200/S00206ED1V01Y200907AIM007
  • QUOTE: Most subfields of computer science have an interface layer via which applications communicate with the infrastructure, and this is key to their success (e.g., the Internet in networking, the relational model in databases, etc.). So far this interface layer has been missing in AI. First-order logic and probabilistic graphical models each have some of the necessary features, but a viable interface layer requires combining both. Markov logic is a powerful new language that accomplishes this by attaching weights to first-order formulas and treating them as templates for features of Markov random fields. Most statistical models in wide use are special cases of Markov logic, and first-order logic is its infinite-weight limit. Inference algorithms for Markov logic combine ideas from satisfiability, Markov chain Monte Carlo, belief propagation, and resolution. Learning algorithms make use of conditional likelihood, convex optimization, and inductive logic programming. Markov logic has been successfully applied to problems in information extraction and integration, natural language processing, robot mapping, social networks, computational biology, and others, and is the basis of the open-source Alchemy system.

2007

• (Poon & Domingos) ⇒ Hoifung Poon, and Pedro Domingos. (2007). “Joint Inference in Information Extraction.” In: Proceedings of the Twenty-Second National Conference on Artificial Intelligence (AAAI 2007).

---