Skip to main content
SpringerLink
Log in

Operational and complete approaches to belief revision

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

Abstract

Two operational approaches to belief revision are presented in this paper. The rules of R-calculus are modified in order to deduce all the maximal consistent subsets. Another set of rules is given in order to deduce all the minimal inconsistent subsets. Then a procedure, which can generate all the maximal consistent subsets, is presented. They are complete approaches, since all the maximal consistent subsets can be deduced or generated. In this paper, only the case of propositional logic is considered.

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. Alchourron C E, Gardenfors P, Makinson D. On the Logic of theory change: Partial meet contraction and revision functions.The Journal of Symbolic Logic, 1985, 50: 510–530.

    Article  MATH  MathSciNet  Google Scholar 

  3. Li Wei, Shen Ningchuan, Wang Ju. R-calculus: A logical approach for knowledge base maintenance.International Journal of Artificial Intelligence Tools, 1995, 4(1&2): 177–200.

    Google Scholar 

  4. Li Wei. An open logic system.Scientica Sinica (Series A), March 1993, 36(3): 362–375.

    MATH  Google Scholar 

  5. Li Wei. A logical framework for knowledge base maintenance.J. of Comput. Sci. & Technol., 1995, 10(3): 194–205.

    Google Scholar 

  6. Boutilier C. Revision Sequences and Nested Conditionals. InProceedings of IJCAI-93, pp.519–525.

  7. Adnan Darwiche, Judea Pearl. On the logic of Iterated Belief Revision. InProceedings of Conference on Theoretical Aspect of Reasoning about Knowledge, CA, 1994, pp.5–23.

  8. Adnan Darwiche, Judea Pearl. On the Logic of iterated belief revision.Artificial Intelligence, 1997, 89(1–2): 1–29.

    Article  MATH  MathSciNet  Google Scholar 

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

  10. Thomas Eiter, Georg Gottlob., On the complexity of propositional knowledge base revision, updates and counterfactuals.Artificial Intelligence, 1992, 57(2–3): 227–270.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Sciences and Engineering, Beijing University of Aeronautics and Astronautics, 100083, Beijing, P.R. China

    Li Wei

  2. Department of Computer Science, Shandong University, 250100, Jinan, P.R. China

    Luan Shangmin

Authors
  1. Li Wei
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Luan Shangmin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Li Wei.

Additional information

This work is supported by the National Natural Science Foundation of China.

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 compuer science at Beijing University of Aeronautics and Astronautics. He has published more than 90 papers concerning the areas of concurrent programming languages, operational semantics, type theories, and logical foundation of artificial intelligence.

LUAN Shangmin received his B.S. degree in mathematics from Shandong Institute of Mining Technology in 1990, and his M.S. and Ph.D. degrees in computer science from Shandong University in 1993 and from Beijing University of Aeronautics and Astronautics in 1999, respectively. His research interests include automatic algorithm design, belief revision, formal specification.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Li, W., Luan, S. Operational and complete approaches to belief revision. J. Comput. Sci. & Technol. 15, 202–212 (2000). https://doi.org/10.1007/BF02948808

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation