A First-Order Logic for Reasoning about Knowledge and Probability
Logic in Computer Science
2019-01-23 v1
Abstract
We present a first-order probabilistic epistemic logic, which allows combining operators of knowledge and probability within a group of possibly infinitely many agents. The proposed framework is the first order extension of the logic of Fagin and Halpern from (J.ACM 41:340-367,1994). We define its syntax and semantics, and prove the strong completeness property of the corresponding axiomatic system.
Cite
@article{arxiv.1901.06886,
title = {A First-Order Logic for Reasoning about Knowledge and Probability},
author = {Siniša Tomović and Zoran Ognjanović and Dragan Doder},
journal= {arXiv preprint arXiv:1901.06886},
year = {2019}
}
Comments
29. pages. This paper is revised and extended version of the conference paper presented at the Thirteenth European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU 2015), in which we introduced the propositional variant of the logic presented here, using a similar axiomatization technique