Markov Logic

An Interface Layer for Artificial Intelligence

By: Pedro Domingos, Daniel Lowd, Ronald Brachman, William W. Cohen, Peter Stone

Write A Review

eBook | 8 May 2009

Sorry, we are not able to source the ebook you are looking for right now.

We did a search for other ebooks with a similar title, however there were no matches. You can try selecting from a similar category, click on the author's name, or use the search box above to find your ebook.

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.