TY - CHAP
T1 - Base belief change for finitary monotonic logics
AU - Pardo, Pere
AU - Dellunde, Pilar
AU - Godo, Lluís
PY - 2010
Y1 - 2010
N2 - 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 satisfying finitarity and monotonicity conditions (neither the deduction theorem nor supraclassicality are required to hold in). 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.
AB - 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 satisfying finitarity and monotonicity conditions (neither the deduction theorem nor supraclassicality are required to hold in). 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.
UR - http://www.scopus.com/inward/record.url?scp=77955031807&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-14264-2_9
DO - 10.1007/978-3-642-14264-2_9
M3 - Chapter
AN - SCOPUS:77955031807
SN - 364214263X
SN - 9783642142635
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 81
EP - 90
BT - Current Topics in Artificial Intelligence - 13th Conference of the Spanish Association for Artificial Intelligence, CAEPIA 2009, Selected Papers
ER -