A Logic for Reasoning About Upper Probabilities
Abstract
We present a propositional logic to reason about the uncertainty of events, where the uncertainty is modeled by a set of probability measures assigning an interval of probability to each event. We give a sound and complete axiomatization for the logic, and show that the satisfiability problem is NP-complete, no harder than satisfiability for propositional logic.
Cite
Text
Halpern and Pucella. "A Logic for Reasoning About Upper Probabilities." Conference on Uncertainty in Artificial Intelligence, 2001. doi:10.1613/JAIR.985Markdown
[Halpern and Pucella. "A Logic for Reasoning About Upper Probabilities." Conference on Uncertainty in Artificial Intelligence, 2001.](https://mlanthology.org/uai/2001/halpern2001uai-logic/) doi:10.1613/JAIR.985BibTeX
@inproceedings{halpern2001uai-logic,
title = {{A Logic for Reasoning About Upper Probabilities}},
author = {Halpern, Joseph Y. and Pucella, Riccardo},
booktitle = {Conference on Uncertainty in Artificial Intelligence},
year = {2001},
pages = {203-210},
doi = {10.1613/JAIR.985},
url = {https://mlanthology.org/uai/2001/halpern2001uai-logic/}
}