• DocumentCode
    2326778
  • Title

    A logic for reasoning about probabilities

  • Author

    Fagin, Ronald ; Halpern, Joseph Y. ; Megiddo, Nimrod

  • Author_Institution
    IBM Almaden Res. Center, San Jose, CA, USA
  • fYear
    1988
  • fDate
    0-0 1988
  • Firstpage
    410
  • Lastpage
    421
  • Abstract
    A language for reasoning about probability is considered that allows statements such as ´the probability of E/sub 1/ is less than 1/3´ and ´the probability of E/sub 1/ is at least twice the probability of E/sub 2/´, where E/sub 1/ and E/sub 2/ are arbitrary events. The case is treated in which all events are measurable (i.e. represent measurable sets), as well as the more general case, which is also of interest in practice, where they may not be measurable. The measurable case is essentially a formalization of (the propositional fragment of) N. Nilson´s (1986) probabilistic logic, while the general (nonmeasurable) case corresponds precisely to replacing probability functions by Dempster-Shafer belief functions. In both cases, an elegant complete axiomization is provided, and it is shown that the problem of deciding satisfiability is NP-complete.<>
  • Keywords
    probabilistic logic; probability; Dempster-Shafer belief functions; NP-complete; complete axiomization; probabilistic logic; probability; probability functions; satisfiability; Artificial intelligence; Computer science; Expert systems; Information analysis; Linear programming; Logic programming; Probabilistic logic;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Logic in Computer Science, 1988. LICS '88., Proceedings of the Third Annual Symposium on
  • Conference_Location
    Edinburgh, UK
  • Print_ISBN
    0-8186-0853-6
  • Type

    conf

  • DOI
    10.1109/LICS.1988.5138
  • Filename
    5138