Abstract
We present a prepositional 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 prepositional logic.
Cite
CITATION STYLE
APA
Halpern, J. Y., & Pucella, R. (2002). A logic for reasoning about upper probabilities. Journal of Artificial Intelligence Research, 17, 57–81. https://doi.org/10.1613/jair.985
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free