Skip to main content
Log in

R-calculus for ELP: An operational approach to knowledge base maintenance

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

Abstract

Some concepts used in knowledge base maintenance, such as sequence, new law, user’s rejection and reconstructions of a knowledge base, are first introduced, and then a framework for extended logic programming (ELP) is given, where an extended logic program is equivalent to a knowledge base. A transition system called R-calculus for ELP is provided. For a given knowledge base and a user’s rejection, the R-calculus for ELP will deduce best revisions of the base. The soundness and the completeness of the R-calculus for ELP are proved, and the R-calculus for ELP is implemented in Prolog. In addition, the research is compared with other relevant work.

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. Alchourrón C, Gärdenfors P, Makinson D. On the logic of theory change: Partial meet contraction and revision.The Journal of Symbolic Logic, 1985, 50: 510–530.

    Article  MATH  MathSciNet  Google Scholar 

  2. Li Wei. An open logic system.Science in China (Series A) 1993, 36: 362–375.

    MATH  Google Scholar 

  3. Li Wei. A logic framework for knowledge base maintenance.Journal of Computer Science and Technology, 1995, 10(3): 193–205.

    Article  MATH  MathSciNet  Google Scholar 

  4. Gelfond M, Lifschitz V. Logic programs with classical negation. InProc. 7th Int’l Conf. on Logic Programming, 1990, pp. 579–597.

  5. Gallier J. Logic for Computer Science, Foundations of Automatic Theorem Proving. John Wiley & Sons, 1987.

  6. Paulson, L. Logic and Computations. Cambridge University Press, 1987.

  7. Gärdenfors P. Knowledge in Flux: Modeling the Dynamic of Epistemic State. The MIT Press, 1988.

  8. Winslett M. Reasoning about action using a possible models approach. InProc. of the American Association of Artificial Intelligence, 1988, pp. 89–93.

  9. Ginsberg M, Smith D. Reasoning about action I: A possible world approach; II: the qualification problem.Artificial Intelligence, 1988 35: Part I: 165–195; Part II: 311–342.

    Article  MATH  MathSciNet  Google Scholar 

  10. Nebel B. A knowledge level analysis of belief revision. InProc. of the Int’l Conf. on Principles of Knowledge Representation and Reasoning, 1989, pp. 301–311.

  11. Willard L, Li Y. The revised Gädenfors postulates and update semantics. InProc. of the 3rd Int’l Conf. on Database LNCS 470, Springer-Verlag, 1990, pp. 409–421.

  12. Lévy F. A survey of belief revision and updating in classical logic.International Journal and Intelligent System, 1994 9: 29–59.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Shen Ningchuan.

Additional information

This work was supported by the National Hi-Tech R&D Programme Grant No. 863306110.

Shen Ningchuan received his B.S. degree and M.S. degree in computer science from Chengdu Institute of Radio Engineering in 1985 and 1988, respectively, and obtained his Ph.D. degree in computer science from Beijing University of Aeronautics and Astronautics in 1995. He has published more than 20 papers in the areas of AI language and knowledge base.

For the biography ofLi Wei, please refer to p.107 of Vol.11 (No. 2, March 1996) of this journal.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shen, N., Li, W. R-calculus for ELP: An operational approach to knowledge base maintenance. J. of Comput. Sci. & Technol. 12, 17–28 (1997). https://doi.org/10.1007/BF02943141

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Navigation