Journal of Computer Science and Technology

, Volume 11, Issue 2, pp 97–107 | Cite as

An operational approach to belief revision

  • Zhang Yuping 
  • Li Wei 


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.


Revision inference rule belief set 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Doyle J A truth maintenance system.Artificial Intelligence, 1979, 12: 231–272.CrossRefMathSciNetGoogle Scholar
  2. [2]
    Gallier J H. Logic for Computer Science, Foundation of Automatic Theorem Proving. John Wiley and Sons, 1987.Google Scholar
  3. [3]
    Chang C C, Keisler H J. Model Theory. North-Holland, 1973.Google Scholar
  4. [4]
    Alchourrón C E, Gärdenfors R, Makinson D. On the logic of theory change.Journal of Symbolic Logic, 1985, 50(2): 510–530.MATHCrossRefMathSciNetGoogle Scholar
  5. [5]
    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
  6. [6]
    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

Copyright information

© Science Press, Beijing China and Allerton Press Inc. 1996

Authors and Affiliations

  • Zhang Yuping 
    • 1
  • Li Wei 
    • 1
  1. 1.Department of Computer ScienceBeijing University of Aeronautics and AstronauticsBeijing

Personalised recommendations