The probabilistic satisfiability of a logical expression is a fundamental concept known as the partition function in statistical physics and field theory, an evaluation of a related graph's Tutte polynomial in mathematics, and the Moore-Shannon network reliability of that graph in engineering.
It is the crucial element for decision-making under uncertainty.
Not surprisingly, it is provably hard to compute exactly or even to approximate.
Many of these applications are concerned only with a subset of problems for which the solutions are monotonic functions.
|Latex generated PDF of files in git repo. This version submitted for review at SIAM Review||1.16 MB|
Publication/Conference Proceeding Name
submitted to SIAM Review
There is no available external link for this item
Defense Threat Reduction Agency
Network Systems Science and Advanced Computing
Alternate Technical Report Number
Institute Technical Report Number