A logic for reasoning about upper probabilities

Preprint

30 July 2003

preprint
Published by arXiv in arXiv

https://doi.org/10.48550/arXiv.cs/0307069

Abstract

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.

Keywords

SATISFIABILITY PROBLEM
UNCERTAINTY IS MODELED
THAN SATISFIABILITY
UPPER PROBABILITIES
PROPOSITIONAL LOGIC
PROBABILITY
NO HARDER

All Related Versions

Version 1, 2003-07-30, ArXiv
Version 1, 2014-08-07, ArXiv (Unconfirmed version)

This publication has 0 references indexed in Scilit: