Probalilistic Logic Programming under Maximum Entropy

Authors:
Thomas Lukasiewicz;Gabriele Kern-Isberner
Affiliations:
-;-
Venue:
ECSQARU '95 Proceedings of the European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty
Year:
1999

Citing 16
Cited 8

Probabilistic logic

Artificial Intelligence
Probabilistic reasoning in intelligent systems: networks of plausible inference

Probabilistic reasoning in intelligent systems: networks of plausible inference
A note on the inevitability of maximum entropy

International Journal of Approximate Reasoning
A logic for reasoning about probabilities

Information and Computation - Selections from 1988 IEEE symposium on logic in computer science
An analysis of first-order logics of probability

Artificial Intelligence
Logic programming

Handbook of theoretical computer science (vol. B)
Probabilistic Horn abduction and Bayesian networks

Artificial Intelligence
From statistical knowledge bases to degrees of belief

Artificial Intelligence
Representation and extraction of information by probabilistic logic

Information Systems
Characterizing the principle of minimum cross-entropy within a conditional-logical framework

Artificial Intelligence
Semantics, Consistency, and Query Processing of Empirical Deductive Databases

IEEE Transactions on Knowledge and Data Engineering
A Mathematical Theory of Communication

A Mathematical Theory of Communication
Random worlds and maximum entropy

Journal of Artificial Intelligence Research
Probabilistic deduction with conditional constraints over basic events

Journal of Artificial Intelligence Research
Relational bayesian networks

UAI'97 Proceedings of the Thirteenth conference on Uncertainty in artificial intelligence
Coherent knowledge processing at maximum entropy by spirit

UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence

First-Order Probabilistic Languages: Into the Unknown

Inductive Logic Programming
Finding Most Probable Worlds of Probabilistic Logic Programs

SUM '07 Proceedings of the 1st international conference on Scalable Uncertainty Management
Using Histograms to Better Answer Queries to Probabilistic Logic Programs

ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Annotated probabilistic temporal logic

ACM Transactions on Computational Logic (TOCL)
A partition-based first-order probabilistic logic to represent interactive beliefs

SUM'11 Proceedings of the 5th international conference on Scalable uncertainty management
Credal networks under maximum entropy

UAI'00 Proceedings of the Sixteenth conference on Uncertainty in artificial intelligence
Probabilistic logic programming under inheritance with overriding

UAI'01 Proceedings of the Seventeenth conference on Uncertainty in artificial intelligence
Focused most probable world computations in probabilistic logic programs

Annals of Mathematics and Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

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.