pith. sign in

arxiv: cs/0307069 · v1 · submitted 2003-07-30 · 💻 cs.AI · cs.LO

A logic for reasoning about upper probabilities

classification 💻 cs.AI cs.LO
keywords logicprobabilitypropositionalsatisfiabilityuncertaintyassigningaxiomatizationcomplete
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.