Products of weighted logic programs

  • Authors:

  • Shay b. Cohen;Robert j. Simmons;Noah a. Smith

  • Affiliations:

  • School of computer science, carnegie mellon university, pittsburgh, pa, usa (e-mail: scohen@cs.cmu.edu, rjsimmon@cs.cmu.edu, nasmith@cs.cmu.edu);School of computer science, carnegie mellon university, pittsburgh, pa, usa (e-mail: scohen@cs.cmu.edu, rjsimmon@cs.cmu.edu, nasmith@cs.cmu.edu);School of computer science, carnegie mellon university, pittsburgh, pa, usa (e-mail: scohen@cs.cmu.edu, rjsimmon@cs.cmu.edu, nasmith@cs.cmu.edu)

  • Venue:
  • Theory and Practice of Logic Programming
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Weighted logic programming, a generalization of bottom-up logic programming, is a well-suited framework for specifying dynamic programming algorithms. In this setting, proofs correspond to the algorithm's output space, such as a path through a graph or a grammatical derivation, and are given a real-valued score (often interpreted as a probability) that depends on the real weights of the base axioms used in the proof. The desired output is a function over all possible proofs, such as a sum of scores or an optimal score. We describe the product transformation, which can merge two weighted logic programs into a new one. The resulting program optimizes a product of proof scores from the original programs, constituting a scoring function known in machine learning as a “product of experts.” Through the addition of intuitive constraining side conditions, we show that several important dynamic programming algorithms can be derived by applying product to weighted logic programs corresponding to simpler weighted logic programs. In addition, we show how the computation of Kullback–Leibler divergence, an information-theoretic measure, can be interpreted using product.