On Paraconsistent Belief Revision in LP
Abstract
Belief revision aims at incorporating, in a rational way, a new piece of information into the beliefs of an agent. Most works in belief revision suppose a classical logic setting, where the beliefs of the agent are consistent. Moreover, the consistency postulate states that the result of the revision should be consistent if the new piece of information is consistent. But in real applications it may easily happen that (some parts of) the beliefs of the agent are not consistent. In this case then it seems reasonable to use paraconsistent logics to derive sensible conclusions from these inconsistent beliefs. However, in this context, the standard belief revision postulates trivialize the revision process. In this work we discuss how to adapt these postulates when the underlying logic is Priest's LP logic, in order to model a rational change, while being a conservative extension of AGM/KM belief revision. This implies, in particular, to adequately adapt the notion of expansion. We provide a representation theorem and some examples of belief revision operators in this setting.
Cite
Text
Schwind et al. "On Paraconsistent Belief Revision in LP." AAAI Conference on Artificial Intelligence, 2022. doi:10.1609/AAAI.V36I5.20532Markdown
[Schwind et al. "On Paraconsistent Belief Revision in LP." AAAI Conference on Artificial Intelligence, 2022.](https://mlanthology.org/aaai/2022/schwind2022aaai-paraconsistent/) doi:10.1609/AAAI.V36I5.20532BibTeX
@inproceedings{schwind2022aaai-paraconsistent,
title = {{On Paraconsistent Belief Revision in LP}},
author = {Schwind, Nicolas and Konieczny, Sébastien and Pérez, Ramón Pino},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {2022},
pages = {5879-5887},
doi = {10.1609/AAAI.V36I5.20532},
url = {https://mlanthology.org/aaai/2022/schwind2022aaai-paraconsistent/}
}