Supposition-based logic for automated nonmonotonic reasoning

  • Philippe Besnard
  • Pierre Siegel
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 310)


We present a first-order logical system based on a standard first-order language which is enriched with new predicate symbols — supposition predicates. The logic is standard. The interesting non-standard features of a nonmonotonic logic are captured by considering whether a given consequence depends on the special predicates. A supposition theory contains formulas of the original language and special axioms governing the behaviour of the suppositions. Our system, when applied to suppositions theories, has many of the desired features of a nonmonotonic logic. We also discuss proof procedures issues.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

6. References

  1. Besnard, Quiniou & Quinton (1983) A theorem-prover for a decidable subset of default logic, Proc. AAAI-83, 27–30.Google Scholar
  2. Boolos (1979) The unprovability of consistency, Cambridge University Press.Google Scholar
  3. Bossu & Siegel (1982) Nonmonotonic reasoning and databases, in: Advances in database theory (ed. Gallaire, Minker & Nicolas), Plenum Press, 239–284.Google Scholar
  4. Bossu & Siegel (1985) Saturation, nonmonotonic reasoning and closed-world assumption, A.I. 25, 13–63.CrossRefGoogle Scholar
  5. Etherington, Mercer & Reiter (1985) On the adequacy of predicate circumscription for closed world reasoning, Comp. Int. 1, 11–15.Google Scholar
  6. Kowalski & Hayes (1969) Semantic trees in automatic theorem-proving, in: Machine Intelligence 4 (ed. Meltzer & Michie), American Elsevier, 87–101.Google Scholar
  7. Kowalski & Kuehner (1971) Linear resolution with selection function, A.I. 2, 227–260.CrossRefGoogle Scholar
  8. McCarthy (1980) Circumscription — A form of nonmonotonic reasoning, A.I. 13, 27–39.CrossRefGoogle Scholar
  9. Moore (1985) Semantical considerations on nonmonotonic logic, A.I. 25, 75–94.CrossRefGoogle Scholar
  10. Reiter (1980) A logic for default reasoning, A.I. 13, 81–132.CrossRefGoogle Scholar
  11. Siegel (1987) Représentation de connaissances en calcul propositionnel, thèse, Marseille.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Philippe Besnard
    • 1
  • Pierre Siegel
    • 2
  1. 1.IRISA Campus de BeaulieuRennes CédexFrance
  2. 2.GIA Université d'Aix-Marseille IIMarseille CédexFrance

Personalised recommendations