How to predict consistently? Full article
| Journal |
Studies in Computational Intelligence
ISSN: 1860-949X , E-ISSN: 1860-9503 |
||
|---|---|---|---|
| Output data | Year: 2019, Volume: 796, Pages: 35-41 Pages count : 7 DOI: 10.1007/978-3-030-00485-9_4 | ||
| Tags | Consistency; Maximal specificity; Prediction; Probabilistic inference | ||
| Authors |
|
||
| Affiliations |
|
Abstract:
One of reasons for arising the statistical ambiguity is using in the course of reasoning laws which have probabilistic, but not logical justification. Carl Hempel supposed that one can avoid the statistical ambiguity if we will use in the probabilistic reasoning maximal specific probabilistic laws. In the present work we deal with laws of the form φ⇒ ψ, where φ and ψ are arbitrary propositional formulas. Given a probability on the set of formulas we define the notion of a maximal specific probabilistic law. Further, we define a prediction operator as an inference with the help of maximal specific laws and prove that applying the prediction operator to some consistent set of formulas we obtain a consistent set of consequences.
Cite:
Vityaev E.
, Odintsov S.
How to predict consistently?
Studies in Computational Intelligence. 2019. V.796. P.35-41. DOI: 10.1007/978-3-030-00485-9_4 Scopus OpenAlex
How to predict consistently?
Studies in Computational Intelligence. 2019. V.796. P.35-41. DOI: 10.1007/978-3-030-00485-9_4 Scopus OpenAlex
Identifiers:
| Scopus: | 2-s2.0-85054706604 |
| OpenAlex: | W2897666907 |