Abstract
We present a proof-theoretical and model-theoretical approach to reasoning about knowledge and conditional probability. We extend both the language of epistemic logic and the language of linear weight formulas, allowing statements like “Agent Ag knows that the probability of A given B is at least a half”. We present both a propositional and a first-order version of the logic. We provide sound and complete axiomatizations for both logics and we prove decidability in the propositional case.
Original language | English |
---|---|
Article number | 109037 |
Pages (from-to) | 1-16 |
Number of pages | 16 |
Journal | International Journal of Approximate Reasoning |
Volume | 163 |
Early online date | 25 Sept 2023 |
DOIs | |
Publication status | Published - Dec 2023 |
Bibliographical note
Publisher Copyright:© 2023
Keywords
- Probabilistic logic
- Epistemic logic
- Completeness theorem
- Decidability