A complete probabilistic belief logic

  • Authors:
  • Zining Cao

  • Affiliations:
  • Department of Computer Science and Engineering, Nanjing University of Aero. & Astro., Nanjing, China

  • Venue:
  • CLIMA VII'06 Proceedings of the 7th international conference on Computational logic in multi-agent systems
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we propose the logic for reasoning about probabilistic belief, called PBLf. Our language includes formulas that essentially express "agent i believes that the probability of φ is at least p". We first provide an inference system of PBLf, and then introduce a probabilistic semantics for PBLf. The soundness and finite model property of PBLf are proven.