Computer Science – Artificial Intelligence
Scientific paper
2010-06-15
TLP 11 (2-3): 263-296, 2011
Computer Science
Artificial Intelligence
Scientific paper
10.1017/S147106841000052
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.
Cohen Shay B.
Simmons Robert J.
Smith Noah A.
No associations
LandOfFree
Products of Weighted Logic Programs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Products of Weighted Logic Programs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Products of Weighted Logic Programs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-105362