|
ИСТИНА |
Войти в систему Регистрация |
ИПМех РАН |
||
On aggregating probabilistic evidenceстатья
Информация о цитировании статьи получена из
Web of Science,
Scopus
Дата последнего поиска статьи во внешних источниках: 19 июля 2016 г.
- Автор: Artemov Sergei
- Сборник: Logical Foundations of Computer Science - International Symposium, LFCS 2016, Deerfield Beach, FL, USA, January 4-7, 2016. Proceedings
- Редактор: Артемов Сергей Николаевич
- Серия: Lecture Notes in Computer Science
- Том: 9537
- Год издания: 2016
- Место издания: Springer
- Первая страница: 27
- Последняя страница: 42
- DOI: 10.1007/978-3-319-27683-0_3
- Аннотация: Imagine a database – a set of propositions Γ={F1,…,Fn} with some kind of probability estimates, and let a proposition X logically follow from Γ. What is the best justified lower bound of the probability of X? The traditional approach, e.g., within Adams’ Probability Logic, computes the numeric lower bound for X corresponding to the worst-case scenario. We suggest a more flexible parameterized approach by assuming probability events u1,u2,…,un which support Γ, and calculating aggregated evidence e(u1,u2,…,un) for X. The probability of e provides a tight lower bound for any, not only a worst-case, situation. The problem is formalized in a version of justification logic and the conclusions are supported by corresponding completeness theorems. This approach can handle conflicting and inconsistent data and allows the gathering both positive and negative evidence for the same proposition.
- Добавил в систему: Золин Евгений Евгеньевич