Abstract

This paper deals with belief base revision, a form of belief change which consists in restoring consistency with the intention of incorporating a new piece of information from the environment, while minimally modifying the agent's belief state represented by a finite set of propositional formulas. In an effort to guarantee more reliability and rationality for real applications while performing revision, we come up with the idea of credible belief base revision. We define two new formula-based revision operators using tools offered by evidence theory. These operators, uniformly presented in the same spirit as [92,13], stem from consistent sub-bases maximal with respect to credibility instead of set inclusion or cardinality. Logical properties and productivity of inference from these operators are established, along with complexity results.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.