Operational and complete approaches to belief revision
Two operational approaches to belief revision are presented in this paper. The rules of R-calculus are modified in order to deduce all the maximal consistent subsets. Another set of rules is given in order to deduce all the minimal inconsistent subsets. Then a procedure, which can generate all the maximal consistent subsets, is presented. They are complete approaches, since all the maximal consistent subsets can be deduced or generated. In this paper, only the case of propositional logic is considered.
Keywordsbelief revision belief set maximal consistent subset
Unable to display preview. Download preview PDF.
- Li Wei, Shen Ningchuan, Wang Ju. R-calculus: A logical approach for knowledge base maintenance.International Journal of Artificial Intelligence Tools, 1995, 4(1&2): 177–200.Google Scholar
- Li Wei. A logical framework for knowledge base maintenance.J. of Comput. Sci. & Technol., 1995, 10(3): 194–205.Google Scholar
- Boutilier C. Revision Sequences and Nested Conditionals. InProceedings of IJCAI-93, pp.519–525.Google Scholar
- Adnan Darwiche, Judea Pearl. On the logic of Iterated Belief Revision. InProceedings of Conference on Theoretical Aspect of Reasoning about Knowledge, CA, 1994, pp.5–23.Google Scholar
- Gallier J H. Logic for Computer Science, Foundations of Automatic Theorem Proving. John Wiley & Sons, 1987.Google Scholar