Skip to main content

A conditional logic for updating in the possible models approach

  • Conference paper
  • First Online:
KI-94: Advances in Artificial Intelligence (KI 1994)

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

Included in the following conference series:

Abstract

In this paper we study Winslett's possible models approach, which is a minimal change semantics where no meta-linguistical information e.g. about preference or entrenchment is involved. Via the Ramsey Test we represent the change operation in the language by a conditional operator. We express minimal change in conditional logics by an axiom C → A>C if A and C do not interfere where two formulas A and C interfere if they have some prepositional variable in common.

Our main results are a complete axiomatization of the possible models approach, a proof procedure based on normal forming, and new complexity results for the case of change restricted to conjunctions or disjunctions of literals.

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

  • B.F. Chellas (1975), Basic conditional logic. J. of Philos. Logic, 4, pp 133–53.

    Google Scholar 

  • T.S. Chou & M. Winslett (1991), Immortal: A model-based belief revision system. Proc. KR'91.

    Google Scholar 

  • A. Del Val (1992), Computing knowledge base updates. Proc. KR'92.

    Google Scholar 

  • Th. Eiter & G. Gottlob (1992), On the complexity of propositional knowledge base revision, updates, and counterfactuals. Journal of AI 57, pp. 227–270.

    Google Scholar 

  • L. Farinas del Cerro & A. Herzig (1988), An automated modal logic for elementary changes. Non-Standard Logics for Automated Reasoning (ed. P Smets, A, Mandani, D. Dubois & H. Prade). Academic Press, pp 63–79.

    Google Scholar 

  • G. Grahne (1991), Updates and Contrafactuals. Proc. KR'91.

    Google Scholar 

  • H. Katsuno & A.O. Mendelzon (1989), A unified view of propositional knowledge base updates. Proc. IJCAI'89.

    Google Scholar 

  • H. Katsuno & A.O. Mendelzon (1991), Propositional knowledge base revision and minimal change. Journal of AI 52, 263–294.

    Google Scholar 

  • H. Katsuno & A.O. Mendelzon (1991), On the Difference between Updating a Knowledge Base and Revising it. Proc. KR'91.

    Google Scholar 

  • H. Katsuno & K. Satoh (1991), A unified view of consequence relation, belief revision and conditional logic. Proc. IJCAI'91.

    Google Scholar 

  • D. K. Lewis (1973), Counterfactuals. Blackwell, Oxford.

    Google Scholar 

  • M. Winslett (1988), Reasoning about actions. Proc. AAAI'88, pp 89–93.

    Google Scholar 

  • M. Winslett (1990), Updating Logical Databases. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press.

    Google Scholar 

  • M. Winslett (1994), Updating Logical Databases. Handbook of Logic in AI (ed. D. Gabbay, A. Galton, C. Hogger), Oxford University Press, to appear.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Bernhard Nebel Leonie Dreschler-Fischer

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

del Cerro, L.F., Herzig, A. (1994). A conditional logic for updating in the possible models approach. In: Nebel, B., Dreschler-Fischer, L. (eds) KI-94: Advances in Artificial Intelligence. KI 1994. Lecture Notes in Computer Science, vol 861. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58467-6_21

Download citation

  • DOI: https://doi.org/10.1007/3-540-58467-6_21

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58467-4

  • Online ISBN: 978-3-540-48979-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics