General Information
Artifact Type
Draft Paper/Unpublished
Abstract/Short Description
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.
Files
Attachment | Size |
---|---|
Latex generated PDF of files in git repo. This version submitted for review at SIAM Review | 1.16 MB |
Publication Details
Year
2021
Month
January
Day
1
Publication/Conference Proceeding Name
submitted to SIAM Review
There is no available external link for this item
Off
Other Information
Funding Agency
Defense Threat Reduction Agency
Alternate Technical Report Number
BII-TR-19-001
Institute Technical Report Number
BI-2021-181