Name
Abstract | ||
|---|---|---|
We slightly improve on characterization results already in the literature for base revision. We show that consistency-based partial meet revision operators can be axiomatized for any sentential logic S satisfying finitarity and monotonicity conditions (neither the deduction theorem nor supraclassicality are required to hold in S). A characterization of limiting cases of revision operators, full meet and maxichoice, is also offered. In the second part of the paper, as a particular case, we focus on the class of graded fuzzy logics and distinguish two types of bases, naturally arising in that context, exhibiting different behavior. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/978-3-642-14264-2_9 | CAEPIA |
Keywords | Field | DocType |
revision operator,finitary monotonic logic,different behavior,satisfying finitarity,particular case,base revision,sentential logic,monotonicity condition,deduction theorem,characterization result,graded fuzzy logic,base belief change,satisfiability,fuzzy logic | T-norm fuzzy logics,Discrete mathematics,Deduction theorem,Fuzzy logic,Propositional calculus,Finitary,Non-monotonic logic,Operator (computer programming),Belief revision,Mathematics,Calculus | Conference |
Volume | ISSN | ISBN |
5988 | 0302-9743 | 3-642-14263-X |
Citations | PageRank | References |
0 | 0.34 | 6 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pere Pardo | 1 | 47 | 8.63 |
| Pilar Dellunde | 2 | 156 | 22.63 |
| Lluís Godo | 3 | 888 | 56.28 |