Justification Logics with Probability Operators
| Autor: | Nenad Savić, Ioannis Kokkinis, Thomas Studer |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2020 |
| Předmět: |
Lottery paradox
TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES 510 Mathematics Linear programming Knowledge representation and reasoning Computer science Complete information Probabilistic logic Calculus Boolean satisfiability problem Rotation formalisms in three dimensions Formal system 000 Computer science knowledge & systems |
| Zdroj: | Probabilistic Extensions of Various Logical Systems ISBN: 9783030529536 |
| DOI: | 10.7892/boris.146176 |
| Popis: | In this chapter we present a formal system that results from the combination of two well known formalisms for knowledge representation: probabilistic logic and justification logic. This framework, called probabilistic justification logic, allows the analysis of epistemic situations with incomplete information. We present two sound and strongly complete probabilistic justification logics, which are defined by adding probability operators to the minimal justification logic J. The first logic does not allow nesting of the probability operators and can be used to express statements like “t is a justification for A with probability at least 30%”. The second logic allows iterations of the probability operators and can be used to express statements like “I am uncertain for the fact that t is a justification for a coin being counterfeit” or to describe more complex epistemic situations like Kyburg’s Lottery Paradox. We also present tight complexity bounds for the satisfiability problem in the aforementioned logics which are obtained with the help of the theory of linear programming and by applying a tableau procedure. Finally, we present two more extensions of the logic J. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|