Compressed constraints in probabilistic logic and their revision

Authors:
Paul Snow
Affiliations:
Department of Computer Science, Plymouth State College, Concord, NH
Venue:
UAI'91 Proceedings of the Seventh conference on Uncertainty in Artificial Intelligence
Year:
1991

Citing 4
Cited 0

Probabilistic logic

Artificial Intelligence
On evidential reasoning in a hierarchy of hypotheses

Artificial Intelligence
Maximum entropy in Nilsson's probabilistic logic

IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 1
An analysis of first-order logics of probability

IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2

Quantified Score

Hi-index	0.00

Visualization

Abstract

In probabilistic logic entailments, even moderate size problems can yield linear constraint systems with so many variables that exact methods are impractical. This difficulty can be remedied in many cases of interest by introducing a three-valued logic (true, false, and "don't care"). The three-valued approach allows the construction of "compressed" constraint systems which have the same solution sets as their two-valued counterparts, but which may involve dramatically fewer variables. Techniques to calculate point estimates for the posterior probabilities of entailed sentences are discussed.