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.
A Logic for Reasoning about Upper Probabilities
Joseph Y. Halpern,Riccardo Pucella
Published 2001 in Conference on Uncertainty in Artificial Intelligence
ABSTRACT
PUBLICATION RECORD
- Publication year
2001
- Venue
Conference on Uncertainty in Artificial Intelligence
- Publication date
2001-08-02
- Fields of study
Mathematics, Computer Science
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-21 of 21 references · Page 1 of 1
CITED BY
Showing 1-34 of 34 citing papers · Page 1 of 1