A general framework for revising nonmonotonic theories

  • Gees Witteveen
  • Wiebe van der Hoek
Regular Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1265)


A general framework for revision of nonmonotonic theories is presented. This framework can be applied if the intended nonmonotonic semantics is not (weakly) cumulative. For weaker semantics, it is shown that revision by contraction is not possible whenever the intended semantics satisfies Weak Cut and revision by expansion fails whenever Weak (Cautious) Monotony fails. Furthermore, it turns out that revision by expansion can be used to test whether the framework can be applied successfully and we analyse the case for logic programming.


Theory Revision Nonmonotonic Reasoning Logic Programming Abstract principles of inference operations 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    P. Gärdenfors, Belief Revision, Cambridge University Press, 1992.Google Scholar
  2. 2.
    N. Bidoit, Negation in rule-based database languages: a survey, Theoretical Computer Science, 78, (1991), 3–83.Google Scholar
  3. 3.
    J. Dix and G. Brewka, Knowledge Representation with Logic Programs, Research Report 15/96. Fachberichte Informatik, Universität Koblenz-Landau, Koblenz, 1996.Google Scholar
  4. 4.
    K. Inoue, C. Sakama, Abductive Framework for Nonmonotonic Theory Change. Proceedings IJCAI'95, 1995.Google Scholar
  5. 5.
    J. Lloyd, Foundations of Logic Programming, Springer Verlag, 1988.Google Scholar
  6. 6.
    D. Makinson, General Patterns in Nonmonotonic Reasoning, in: D.M. Gabbay, C.J. Hogger, J.A. Robinson (eds) Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. 3, Nonmonotonic Reasoning, Oxford Science Publications, Oxford, 1994.Google Scholar
  7. 7.
    V. Marek and M. Truszczyński, Nonmonotonic Logic, Springer Verlag, Heidelberg, 1993.Google Scholar
  8. 8.
    Morris, P., Stable Closures, Defeasible Logic and Contradiction Tolerant Reasoning, Proceedings of the 7th National Conference on Artificial Intelligence, 1988.Google Scholar
  9. 9.
    L. M. Pereira, J. J. Alferes and J. N. Aparicio. Contradiction Removal within well-founded semantics. In: A. Nerode, W. Marek and V. S. Subrahmanian, (eds.), First International Workshop on Logic Programming and Non-monotonic Reasoning, MIT Press, 1991.Google Scholar
  10. 10.
    C. Witteveen and W. van der Hoek, Revision by Communication. In: V. Marek, A. Nerode and M. Truszczyński, editors, Logic Programming and Non-Monotonic Reasoning, LNAI 928, pp. 189–202, Springer Verlag, 1995.Google Scholar
  11. 11.
    C. Witteveen and W. van der Hoek, Some Postulates for Nonmonotonic Theory Revision Applied to Logic Programming. In: R. Dyckhoff, H. Herre and P. Schroeder-Heister, editors, Extensions of Logic Programming, LNAI 1050, pp. 303–318, Springer Verlag, 1995.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Gees Witteveen
    • 1
    • 2
  • Wiebe van der Hoek
    • 2
  1. 1.Department of Mathematics and Computer ScienceDelft University of TechnologyAJ DelftNetherlands
  2. 2.Department of Computer ScienceUtrecht UniversityCH UtrechtNetherlands

Personalised recommendations