Skip to main content
SpringerLink
Log in

Update postulates without inertia

  • Conference paper
  • First Online:
Symbolic and Quantitative Approaches to Reasoning and Uncertainty (ECSQARU 1995)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 946))

Abstract

Starting from Katsuno and Mendelzon postulates, a new set of postulates which is minimal and complete has been defined, these postulates characterize an update operator. The update operator class which is obtained is larger than Katsuno and Mendelzon's one, since it includes updating operators which are not inert, and which allow for the existence of unreachable states. The main property is that every update operator satisfying this new set of postulates admits an underlying ranked transition graph. The rank-ordering of its transitions has not to be faithful as in Katsuno and Mendelzon system.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C. Alchourrón, P. Gärdenfors, and D. Makinson. On the logic of theory change: partial meet contraction and revision functions. Journal of Symbolic Logic, 50:510–530, 1985.

    Google Scholar 

  2. C. Boutilier. An event-based abductive model of update. In Proc. of the Tenth Canadian Conf. on Artficial Intelligence, 1994.

    Google Scholar 

  3. Collectif. Inter-prc: Gestion de l'evolutif et de l'incertain. In 5ièmes journées nationales du PRC GDR, pages 77–119, Nancy, France, February 1995.

    Google Scholar 

  4. D. Dubois, F. Dupin de Saint-Cyr, and H. Prade. Updating, transition constraints and possibilistic Markov chains. In Proc. of the 4th Conf. on Information Processing and Management of Uncertainty in Knowledge-Based Systems, pages 826–831, Paris, France, July 1994.

    Google Scholar 

  5. D. Dubois and H. Prade. A survey of belief revision and updating rules in various uncertainty models. International journal of Intelligent Systems, 9:61–100, 1994.

    Google Scholar 

  6. H. Katsuno and A.O. Mendelzon. On the difference between updating a knowledge base and revising it. In J. Allen and al., editors, Proc. of the 2nd Inter. Conf. on Principles of Knowledge Representation and Reasoning, pages 387–394, Cambridge, MA, 1991.

    Google Scholar 

  7. M. Winslett. Reasoning about action using a possible models approach. In Proc. of the 7th National Conference on Artificial Intelligence, pages 89–93, St. Paul, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. I.R.I.T., 118 route de Narbonne, 31062, Toulouse Cedex, France

    D. Dubois, F. Dupin de Saint-Cyr & H. Prade

Authors
  1. D. Dubois
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. F. Dupin de Saint-Cyr
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. H. Prade
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Christine Froidevaux Jürg Kohlas

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dubois, D., Dupin de Saint-Cyr, F., Prade, H. (1995). Update postulates without inertia. In: Froidevaux, C., Kohlas, J. (eds) Symbolic and Quantitative Approaches to Reasoning and Uncertainty. ECSQARU 1995. Lecture Notes in Computer Science, vol 946. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60112-0_19

Download citation

  • DOI: https://doi.org/10.1007/3-540-60112-0_19

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60112-8

  • Online ISBN: 978-3-540-49438-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation