A logic for reasoning about upper probabilities
| dc.creator | Halpern, Joseph Y. | |
| dc.creator | Pucella, Riccardo | |
| dc.date | 2003-07-30 | |
| dc.date.accessioned | 2026-07-07T03:20:09Z | |
| dc.date.available | 2026-07-07T03:20:09Z | |
| dc.description | We present a propositional logic %which can be used 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. | |
| dc.description | A preliminary version of this paper appeared in Proc. of the 17th Conference on Uncertainty in AI, 2001 | |
| dc.identifier | https://arxiv.org/abs/cs/0307069 | |
| dc.identifier | http://arxiv.org/abs/cs/0307069 | |
| dc.identifier | Journal of AI Research 17, 2001, pp. 57-81 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/31729 | |
| dc.subject | Artificial Intelligence | |
| dc.subject | Logic in Computer Science | |
| dc.subject | I.2.4; F.2.1 | |
| dc.title | A logic for reasoning about upper probabilities | |
| dc.type | text |