Skip to main content
Log in

A logical framework for knowledge base maintenance

  • Regular Papers
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

The maintenance sequences of a knowledge base and their limits are introduced. Some concepts used in knowledge base maintenance, such as new laws, user's rejections, and reconstructions of a knowledge base are defined; the related theorems are proved. A procedure is defined using transition systems; it generates maintenance sequences for a given user's model and a knowledge base. It is proved that all sequences produced by the procedure are convergent, and their limit is the set of true sentences of the model. Some computational aspects of reconstructions are studied. An R-calculus is given to deduce a reconstruction when a knowledge base meets a user's rejection. The work is compared with AGM's theory of belief revision.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Doyle J. A truth maintenance system.Artificial Intelligence, 1979, 12: 231–272.

    Article  MathSciNet  Google Scholar 

  2. Alchourrón C E, Gärdenfors R, Makinson D. On the logic of theory change: Partial meet contraction and revision functions.The Journal of Symbolic Logic, 1985, 50: 2.

    Article  Google Scholar 

  3. Gallier J H. Logic for Computer Science, foundations of automatic theorem proving. John Wiley & Sons, 1987, pp. 147–158, pp.162–163, pp. 197–217.

  4. Paulson L. Logic and Computations. Cambridge University Press, 1987, pp. 38–50.

  5. Li Wei. An open logic system.Scientia Sinica (Series A), Oct. 1992 (in Chinese); March 1993 (in English).

  6. Plotkin G. An structural approach to operational semantics. Lecture Notes, Aarhus University, Denmark, 1982.

    Google Scholar 

  7. Gärdenfors P. Knowledge in Flux. The MIT Press, 1988.

  8. Garey M R, Johnson D S. Computers and Intractability. Freeman and Company, 1979.

  9. Shoenfield J R. Mathematical Logic. Addison-Wesley, Reading, Mass, 1967, pp. 74–75.

    MATH  Google Scholar 

  10. Eiter T, Gottlob G. On the complexity of propositional knowledge base revision.Artificial Intelligence, 1992, 57.

Download references

Author information

Authors and Affiliations

Authors

Additional information

Li Wei received his B.S. degree in mathematics from Peking University in 1966 and obtained his Ph.D. degree in computer science from The University of Edinburgh in 1983. Since 1986, he has been a Professor in computer science at Beijing University of Aeronautics and Astronautics. He has published more than 90 papers which concern the areas of concurrent programming languages, operational semantics, type theories, and logical foundation of artificial intelligence.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Li, W. A logical framework for knowledge base maintenance. J. of Compt. Sci. & Technol. 10, 193–205 (1995). https://doi.org/10.1007/BF02943487

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02943487

Keywords

Navigation