A Logic for Reasoning about Upper Probabilities | Zendy

Joseph Y. Halpern | Zendy; Riccardo Pucella | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A Logic for Reasoning about Upper Probabilities

Author(s) -

Joseph Y. Halpern,

Riccardo Pucella

Publication year - 2002

Publication title -

journal of artificial intelligence research

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.79

H-Index - 123

eISSN - 1943-5037

pISSN - 1076-9757

ISBN - 1-55860-800-1

DOI - 10.1613/jair.985

Subject(s) - satisfiability , propositional calculus , autoepistemic logic , well formed formula , propositional variable , computer science , set (abstract data type) , mathematics , zeroth order logic , boolean satisfiability problem , event (particle physics) , interval (graph theory) , dynamic logic (digital electronics) , interval temporal logic , discrete mathematics , theoretical computer science , linear temporal logic , algorithm , intermediate logic , multimodal logic , description logic , programming language , combinatorics , physics , quantum mechanics , transistor , voltage

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research