Uncertainty in Artificial Intelligence
First Name   Last Name   Password   Forgot Password   Log in!
    Proceedings   Proceeding details   Article details         Authors         Search    
Compressed Constraints in Probabilistic Logic and Their Revision
Paul Snow
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.
Keywords:
Pages: 386-391
PS Link:
PDF Link: /papers/91/p386-snow.pdf
BibTex:
@INPROCEEDINGS{Snow91,
AUTHOR = "Paul Snow ",
TITLE = "Compressed Constraints in Probabilistic Logic and Their Revision",
BOOKTITLE = "Proceedings of the Seventh Conference Annual Conference on Uncertainty in Artificial Intelligence (UAI-91)",
PUBLISHER = "Morgan Kaufmann",
ADDRESS = "San Mateo, CA",
YEAR = "1991",
PAGES = "386--391"
}


hosted by DSL   •   site info   •   help