Maximum-Entropy Probabilistic Logics

Authors:
Mark A. Paskin
Affiliations:
-
Venue:
Maximum-Entropy Probabilistic Logics
Year:
2001

Citing 0
Cited 3

Markov logic networks

Machine Learning
Probabilistic reasoning with answer sets

Theory and Practice of Logic Programming
Using the probabilistic logic programming language P-log for causal and counterfactual reasoning and non-naive conditioning

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

I present probabilistic extensions to propositional and first-order logic. The general approach is to define a probability distribution over possible worlds; this distribution is chosen as the unique distribution that agrees with a set of probability constraints over a set of logical sentences and that has maximal entropy. Such distributions are well studied in the Statistics and Machine Learning literature, and using them not only results in simple, intuitive models, but makes available standard inference and learning algorithms.