Name
Abstract | ||
|---|---|---|
This paper is set to study the applicability of AGM-like operations to probabilistic bases. We focus on the problem of consistency restoration, also called consolidation or contraction by falsity. We aim to identify the reasons why the set of AGM postulates based on discrete operations of deletions and accretions is too coarse to treat finely adjustable probabilistic formulas. We propose new principles that allow one to deal with the consolidation of inconsistent probabilistic bases, presenting a finer method called liftable contraction. Furthermore, we show that existing methods for probabilistic consolidation via distance minimization are particular cases of the methods proposed. |
Year | Venue | Field |
|---|---|---|
2016 | KR | Falsity,Computer science,Algorithm,Theoretical computer science,Minification,Artificial intelligence,Probabilistic logic,Consolidation (soil),Belief revision |
DocType | Citations | PageRank |
Conference | 2 | 0.36 |
References | Authors | |
7 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Glauber de Bona | 1 | 31 | 6.59 |
| Marcelo Finger | 2 | 365 | 48.82 |
| Márcio Moretto Ribeiro | 3 | 61 | 6.50 |
| Yuri D. Santos | 4 | 3 | 2.09 |
| Renata Wasserman | 5 | 17 | 2.90 |