Base belief change for finitary monotonic logics

Pere Pardo*, Pilar Dellunde, Lluís Godo

*Corresponding author for this work

Research output: Chapter in BookChapterResearchpeer-review

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 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.

Original languageEnglish
Title of host publicationCurrent Topics in Artificial Intelligence - 13th Conference of the Spanish Association for Artificial Intelligence, CAEPIA 2009, Selected Papers
Pages81-90
Number of pages10
DOIs
Publication statusPublished - 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5988 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Fingerprint

Dive into the research topics of 'Base belief change for finitary monotonic logics'. Together they form a unique fingerprint.

Cite this