A First-Order Logic for Reasoning about Knowledge and Probability
| Autor: | Zoran Ognjanović, Siniša Tomović, Dragan Doder |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2019 |
| Předmět: |
FOS: Computer and information sciences
Computer Science - Logic in Computer Science Theoretical computer science General Computer Science Logic Computer science 02 engineering and technology Semantics 01 natural sciences Probabilistic reasoning Reasoning about belief and knowledge Modal and temporal logics Theoretical Computer Science Epistemic modal logic Computer Science::Logic in Computer Science 0202 electrical engineering electronic engineering information engineering 0101 mathematics Axiom Group (mathematics) Least-upper-bound property 010102 general mathematics Probabilistic logic 16. Peace & justice First-order logic Syntax (logic) Logic in Computer Science (cs.LO) Computational Mathematics TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES 020201 artificial intelligence & image processing |
| Popis: | 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. 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 |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|