Probabilistic Logic over Paths | Zendy

Evan Tzanis | Zendy; Robin Hirsch | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Probabilistic Logic over Paths

Author(s) -

Evan Tzanis,

Robin Hirsch

Publication year - 2008

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2008.11.020

Subject(s) - probabilistic logic , probabilistic ctl , modal logic , expressive power , computer science , theoretical computer science , path (computing) , probabilistic argumentation , extension (predicate logic) , discrete mathematics , completeness (order theory) , dynamic logic (digital electronics) , computation , mathematics , modal , algorithm , programming language , artificial intelligence , probabilistic analysis of algorithms , mathematical analysis , chemistry , physics , transistor , voltage , quantum mechanics , polymer chemistry

We introduce a probabilistic modal logic PPL extending the work of [Ronald Fagin, Joseph Y. Halpern, and Nimrod Megiddo. A logic for reasoning about probabilities. Information and Computation, 87(1,2):78–128, 1990; Ronald Fagin and Joseph Y. Halpern. Reasoning about knowledge and probability. Journal of the ACM, 41(2):340–367, 1994] by allowing arbitrary nesting of a path probabilistic operator and we prove its completeness. We prove that our logic is strictly more expressive than other logics such as the logics cited above. By considering a probabilistic extension of CTL we show that this additional expressive power is really needed in some applications

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