Skip to main content

Credal Networks under Maximum Entropy

Thomas Lukasiewicz

Abstract

In this paper, we focus on the combination of probabilistic logic programming with the principle of maximum entropy. We start by defining probabilistic queries to probabilistic logic programs and their answer substitutions under maximum entropy. We then present an efficient linear programming characterization for the problem of deciding whether a probabilistic logic program is satisfiable. Finally, and as a central contribution of this paper, we introduce an efficient technique for approximative probabilistic logic programming under maximum entropy. This technique reduces the original entropy maximization task to solving a modified and relatively small optimization problem.

Book Title
Proceedings of the 16th Conference in Uncertainty in Artificial Intelligence‚ UAI 2000‚ Stanford‚ California‚ USA‚ June 30 − July 3‚ 2000
Editor
Craig Boutilier and Moisés Goldszmidt
ISBN
1−55860−709−9
Pages
363−370
Publisher
Morgan Kaufmann
Year
2000