Skip to main content
SpringerLink
Log in

A practical propositional knowledge base revision algorithm

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

Abstract

This paper gives an outline of knowledge base revision and some recently presented complexity results about propositional knowledge base revision. Different methods for revising propositional knowledge base have been proposed recently by several researchers, but all methods are intractable in the general case. For practical application, this paper presents a revision method for special case, and gives its corresponding polynomial algorithm.

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. Gardenfors P. Epistemic importance and minimal changes of belief. Australasian J. Philos, 1984, 62: 136–157.

    Article  Google Scholar 

  2. Huang Zhisheng. Theory and Methods of Belief Revision.Computer Science, 1991, (6): 12–16. (in Chinese)

    Google Scholar 

  3. Eiter T, Gottlob G. On the complexity of propositional knowledge base revision, updates, and counterfactuals.Artificial Intelligence, 1992, 57: 227–270.

    Article  MATH  MathSciNet  Google Scholar 

  4. Katsuno H, Medelzon A O. On the difference between updating a knowledge base and revising it. InProc. KR-91, 1991, pp.387–395.

  5. Grahne G. Updates and counterfactuals. InProc. KR-91, 1991, pp. 269–276.

  6. Nebel B. Belief revision and default reasoning: Syntax-based approaches. InProc. KR-91, 1991, pp. 417–428.

  7. Winslett M. Updating Logical Databases. Cambridge University Press, Cambridge, England, 1990.

    MATH  Google Scholar 

  8. Ma Shaohan. Algorithm Analysis and Design. Shandong University Press, 1992. (in Chinese)

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Shandong University, 250100, Jinan

    Tao Xuehong, Sun Wei & Ma Shaohan

Authors
  1. Tao Xuehong
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sun Wei
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ma Shaohan
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

The research was supported by National Natural Science Foundation and National 863 Programme of China.

Tao Xuehong was born in 1969. She received her Ph.D. degree in computer software from Shandong University. Now she is a Lecturer of Department of Computer Science, Shandong University. Her research interests include knowledge base revision.

Sun Wei was born in 1966. He received his Ph.D. degree in computer software from Shandong University. Now he is a Lecturer of Department of Computer Science, Shangdong University. His research interests include AI and parallel algorithm.

Ma Shaohan was born in 1938. He is now a Professor and the Dean of Department of Computer Science, Shandong University. His research interests include AI and parallel algorithm.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tao, X., Sun, W. & Ma, S. A practical propositional knowledge base revision algorithm. J. of Comput. Sci. & Technol. 12, 154–159 (1997). https://doi.org/10.1007/BF02951334

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation