An operational approach to belief revision
A deduction system, called RE-proof system, is constructed for generating the revisions of first order belief sets. When a belief set is rejected by a given fact, all maximal subsets of the belief set consistent with the fact can be deduced from the proof system. The soundness and completeness of the RE-proof system are proved, which imply that there exists a resolution method to decide whether a revision retains a maximal subset of a belief set.
KeywordsRevision inference rule belief set
Unable to display preview. Download preview PDF.
- Gallier J H. Logic for Computer Science, Foundation of Automatic Theorem Proving. John Wiley and Sons, 1987.Google Scholar
- Chang C C, Keisler H J. Model Theory. North-Holland, 1973.Google Scholar
- Li Wei. A logical framework for evolution of specifications. InProgramming Languages and Systems, (ESOP'94), LNCS 788, Springer-Verlag, 1994, pp.394–408.Google Scholar
- Li Wei, Shen N, Wang J. R-calculus: A logical approach for knowledge base maintenance. InThe Sixth International Conference on Tools with Artificial Intelligence, 1994, pp.375–381.Google Scholar