Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Updating, transition constraints and possibilistic Markov chains

  • Possibility Theory
  • Conference paper
  • First Online:
Advances in Intelligent Computing — IPMU '94 (IPMU 1994)

Abstract

Possibility theory is applied to the updating problem in a knowledge base that describes the state of an evolving system. The system evolution is described by a possibilistic Markov chain whose agreement with the axioms of updating is examined. Then it is explained how to recover a possibilistic Markov chain from a set of transition constraints, on the basis of a specificity ordering.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Benferhat S., Dubois D., Prade H. (1992) Representing default rules in possibilistic logic. Proc. 3rd Conf. on Principles of Knowledge Representation and Reasoning (KR'92) (B. Nebel et al., eds.), Cambridge, MA, 673–684.

    Google Scholar 

  2. Benferhat S., Cayrol C., Dubois D., Lang J., Prade H. (1993) Inconsistency management and prioritized syntax-based entailment. Proc. 13th Int. Joint Conf. on Artificial Intelligence (IJCAI'93), 640–645, Chambéry.

    Google Scholar 

  3. Brown F. (Ed.) (1988) The Frame Problem in Artificial Intelligence. Morgan & Kaufmann, San Mateo, CA.

    Google Scholar 

  4. Cholvy L. (1994) Database updates and transition constraints. Int. J. Intelligent Systems, 9, 169–180.

    Google Scholar 

  5. Cordier M.O., Siegel P. (1992) A temporal revision model for reasoning about change. Proc. 3rd Conf. on Principles of Knowledge Representation and Reasoning (KR'92) (B. Nebel and al., eds.), Cambridge, MA, 732–739.

    Google Scholar 

  6. Cordier M.O., Siegel P. (1993) Prioritized transitions for updates. Proc. AI'93 Workshop on “Belief Change: Bridging the Gap Between Theory and Practice”, Melbourne and Technical report IRISA, n 884, 1994, Rennes, France.

    Google Scholar 

  7. Dubois D., Prade H. (1988) Possibility Theory. Plenum Press, New York.

    Google Scholar 

  8. Dubois D., Prade H. (1991) Possibilistic logic, preferential models, non-monotonicity and related issues. Proc. 12th Int. Joint Conf. on Artificial Intelligence (IJCAI'91), Sydney, Australia, Aug. 24–30, 419–424.

    Google Scholar 

  9. Dubois D., Prade H.(1993) Belief revision and updates in numerical formalisms. Proc. 13th Int. Joint Conf. on Artificial Intelligence (IJCAI'90), 620–625, Chambéry.

    Google Scholar 

  10. Dubois D., Dupin de Saint-Cyr F., Prade H. (1995) Update postulates without inertia. Inter. Rep. IRIT, Toulouse University, France.

    Google Scholar 

  11. Goldszmidt M., Pearl J. (1992) Rank-based systems: A simple approach to belief revision belief update and reasoning about evidence and actions. Proc. 3rd Conf. on Principles of Knowledge Representation and Reasoning (KR'92) (B. Nebel and al., eds.), Cambridge, MA, 661–672.

    Google Scholar 

  12. Katsuno H., Mendelzon A.O. (1991) On the difference between updating a knowledge base and revising it. Proc. 2nd Conf. on Principles of Knowledge Representation and Reasoning (KR'91) (J. Allen et al., eds.), Cambridge, MA, 387–394.

    Google Scholar 

  13. Pearl J. (1990) System Z: a natural ordering of defaults with tractable applications to default reasoning. Proc 3rd Conf. on Theoretical Aspects of Reasoning About Knowledge (M. Vardi, ed.), Morgan Kaufman, San Mateo, CA, 121–135.

    Google Scholar 

  14. Sandewall E. (1993) The range of applicability of nonmonotonic logics for the inertia problem. Proc. 13th Int. Joint Conf. on Artificial Intelligence (IJCAI'93), 738–743, Chambéry.

    Google Scholar 

  15. Winslett M. (1990) Updating Logical Databases. Cambridge University Press, Cambridge, UK.

    Google Scholar 

  16. Zadeh L.A. (1978) Fuzzy sets as a basis for a theory of possibility. Fuzzy Sets and Systems, 1, 3–28.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Bernadette Bouchon-Meunier Ronald R. Yager Lotfi A. Zadeh

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dubois, D., de Saintcyr, F.D., Prade, H. (1995). Updating, transition constraints and possibilistic Markov chains. In: Bouchon-Meunier, B., Yager, R.R., Zadeh, L.A. (eds) Advances in Intelligent Computing — IPMU '94. IPMU 1994. Lecture Notes in Computer Science, vol 945. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0035959

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60116-6

  • Online ISBN: 978-3-540-49443-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics