Determining Lower and Uper Bounds on Probabilities of Logical Formulas Represented by Digraphs.
Year of publication: |
1994
|
---|---|
Authors: | Andersen, K.A. ; Hooker, J.N. |
Institutions: | Carnegie Mellon University, Tepper School of Business |
Subject: | probability |
-
Sigel, Katja, (2008)
-
Shaw, Subhadra Bose, (2018)
-
Kleanthous, Irene, (2016)
- More ...
-
A Linear Programming Pramework for Logics of Uncertainty.
Andersen, K.A., (1992)
-
DOES ARTIFICIAL INTELLIGENCE REST ON A MISTAKE?
HOOKER, J.N., (1989)
-
Branching Rules for Satisfiabiblity.
Hooker, J.N., (1994)
- More ...