Skip to main content
SpringerLink
Log in

A programmable approach to maintenance of a finite knowledge base

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

Abstract

In this paper, we present a programmable method of revising a finite clause set. We first present a procedure whose formal parameters are a consistent clause set Γ and a clauseA and whose output is a set of minimal subsets of Γ which are inconsistent withA. The maximal consistent subsets can be generated from all minimal inconsistent subsets. We develop a prototype system based on the above procedure, and discuss the implementation of knowledge base maintenance. At last, we compare the approach presented in this paper with other related approaches. The main characteristic of the approach is that it can be implemented by a computer program.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

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. Fagin R, Ullman J D, Vardi M Y. On the semantics of updates in databases. InProc. 2nd ACM SIGACT-SIGMOD Symposium on Principle of Database Systems, Atlanta, Georgia, USA, 1983, pp.352–365.

  3. Ginsberg M L, Smith D E. Reasoning about action I: A possible worlds approach.Artificial Intelligence, 1988, 35: 165–195.

    Article  MATH  MathSciNet  Google Scholar 

  4. Dalal M. Investigations into a theory of knowledge base revision: Preliminary report. InProc. 7th National Conference on Artificial Intelligence, Saint Paul, Minnesota, USA, 1988, pp.475–479.

  5. Satoh K. Nonmonotonic reasoning by minimal belief revision. InProc. International Conference on Fifth Generation Computer System, Tokyo, Japan, 1988, pp.455–462.

  6. Borgida A. Language features for flexible handling of exception in information systems.ACM Transactions on Database System, 1985, 10: 536–603.

    Google Scholar 

  7. Weber A. Updating propositional formulas. InProc. First Conference on Expert Database Systems, South Carolina, USA, 1986, pp.487–500.

  8. Forbus K D. Introducing actions into qualitative simulation. InProc. International Joint Conference on Artificial Intelligence, Detroit, Michigan, USA, 1989, pp.1273–1278.

  9. Winslett M. Reasoning about action using possible models approach. InProc. the Seventh National Conference on Artificial Intelligence, Saint Paul, Minnesota, USA, 1988, pp.89–93.

  10. Alchourron C E, Gardenfors P, Markinson D. On the logic of theory change: Partial meet contraction and revision functions.The Journal of Symbolic Logic, 1985, 50(2): 510–530.

    Article  MATH  MathSciNet  Google Scholar 

  11. Darwiche A, Pearl J. On the logic of iterated belief revision.Artificial Intelligence, 1997, 89(1&2): 1–29.

    Article  MATH  MathSciNet  Google Scholar 

  12. Boutilier C. Revision sequences and nested conditionals. InProc. International Conference on Artificial Intelligence, Toronto, Ontario, Canada, 1993, pp.519–525.

  13. Li Wei. An open logic system.Science in China (Series A) 1993, 22(10): 1103–1113.

    Google Scholar 

  14. Dixon S E. A finite base belief revision system. InProc. Sixteenth Australian Computer Science Conference, Brisbane, Australia, 1993, pp.445–451.

  15. Dixon S E, Wocke W R. The implementation of a first-order logic AGM belief revision system. InProc. the Thirteenth International Joint Conference on Artificial Intelligence, Chambery, France 1993, pp.534–539.

  16. Wobcke W R. A belief revision approach to nonmonotonic reasoning. InProc. the Fifth Australian Joint Conference on Artificial Intelligence, Hobart, Australia, 1992, pp.278–283.

  17. Williams M A. Towards a practical approach to belief revision: Reason-based approach. InProc. the Fifth International Joint Conference on Principles of Knowledge Representation and Reasoning, Cambridge, Massachusetts, USA, 1993, pp.412–421.

  18. Damásio C V, Nejdl W, Pereira L P. REVISE: An extended logic programming systems for revising knowledge bases. InProc. the International Conference on Knowledge Representation and Reasoning Bonn, Germany, 1994, pp.607–618.

  19. Gallier J H. Logic for Computer Science: Foundations of Automatic Theorem Proving. New York: John Wiley & Sons, 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Software, The Chinese Academy of Sciences, 100080, Beijing, P.R. China

    Luan ShangMin & Dai GuoZhong

  2. Department of Computer Science and Engineering, Beijing University of Aeronautics and Astronautics, 100083, Beijing, P.R. China

    Li Wei

Authors
  1. Luan ShangMin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dai GuoZhong
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Li Wei
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Luan ShangMin.

Additional information

This work is supported by the Chinese National Foundation of Science under Grant Nos.60033020 and 60103020 and China Postdoctoral Science Foundation.

LUAN ShangMin was born in 1968. He got his B.S. degree from Shandong University of Science and Technology in 1990, M.S. degree in computer science and software from Shandong University, and Ph.D. degree from Beijing University of Aeronautics and Astronautics in 1999. Now, he works in Institute of Software, Chinese Academy of Sciences. His interests are human-computer interaction, belief revision, artificial intelligence.

DAI GuoZhong was born in 1944. Now he is a professor of Institute of Software, Chinese Academy of Sciences. His interests are human-computer interaction, computer graphic, and CAD.

LI Wei was born in 1943. He is a professor of Beijing University of Aeronautics and Astronautics. He is a member of Chinese Academy of Sciences. His interests are mathematic logic, formal method, artificial intelligence.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Luan, S., Dai, G. & Li, W. A programmable approach to maintenance of a finite knowledge base. J. Comput. Sci. & Technol. 18, 102–108 (2003). https://doi.org/10.1007/BF02946657

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation