A dynamic ordering relation for revision

  • Kohler Arnaud
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 747)


one of the most frequently met problems in theory revision is the taking into account of the world history (the order of arrival of the information, for example) and links between knowledge (to what degree is a fact more important than another, for example ?). This paper proposes an algebraic approach to describe (or process) the changes of the world based on a dynamic partial order relation (representing preference) and to describe the models for some logical (deductive) systems. Though taking into account previous states (information is managed in priority following the order of arrival), we will see that the process avoids the necessity of keeping the complete world history.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [BosSie85]
    Geneviève Bossu, Pierre Siegel, “Saturation, Nonmonotonic Reasoning and the Closed-World Assumption”, Artificial Intelligence 25 (1985), pp 13–63.Google Scholar
  2. [Sho88]
    Y. Shoham, “Reasoning About Change-Time and Causation from the Standpoint of Artificial Intelligence”, The MIT Press, Cambridge, Mass., 1988.Google Scholar
  3. [LehMag90]
    Daniel Lehman, Menachem Magidor, “What does a conditional knowledge base entail ?”, Departement of Computer Science, Hebrew University, Jerusalem 91904, Israel, June 1990.Google Scholar
  4. [KohSie93]
    Arnaud Kohler, Pierre Siegel, ”Ordering relation and revision”, TR'93, LIUP-Marseille.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Kohler Arnaud
    • 1
  1. 1.Liup-Marseille Université de Provence UFR-MIM Case A 3Marseille Cedex 3France

Personalised recommendations