Skip to main content
SpringerLink
Log in

Supposition-based logic for automated nonmonotonic reasoning

  • Conference paper
  • First Online:
9th International Conference on Automated Deduction (CADE 1988)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 310))

Included in the following conference series:

Abstract

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.

This research has been sponsored by CNRS (GRECO PRC IA)

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

6. References

  • Besnard, Quiniou & Quinton (1983) A theorem-prover for a decidable subset of default logic, Proc. AAAI-83, 27–30.

    Google Scholar 

  • Boolos (1979) The unprovability of consistency, Cambridge University Press.

    Google Scholar 

  • Bossu & Siegel (1982) Nonmonotonic reasoning and databases, in: Advances in database theory (ed. Gallaire, Minker & Nicolas), Plenum Press, 239–284.

    Google Scholar 

  • Bossu & Siegel (1985) Saturation, nonmonotonic reasoning and closed-world assumption, A.I. 25, 13–63.

    Article  Google Scholar 

  • Etherington, Mercer & Reiter (1985) On the adequacy of predicate circumscription for closed world reasoning, Comp. Int. 1, 11–15.

    Google Scholar 

  • Kowalski & Hayes (1969) Semantic trees in automatic theorem-proving, in: Machine Intelligence 4 (ed. Meltzer & Michie), American Elsevier, 87–101.

    Google Scholar 

  • Kowalski & Kuehner (1971) Linear resolution with selection function, A.I. 2, 227–260.

    Article  Google Scholar 

  • McCarthy (1980) Circumscription — A form of nonmonotonic reasoning, A.I. 13, 27–39.

    Article  Google Scholar 

  • Moore (1985) Semantical considerations on nonmonotonic logic, A.I. 25, 75–94.

    Article  Google Scholar 

  • Reiter (1980) A logic for default reasoning, A.I. 13, 81–132.

    Article  Google Scholar 

  • Siegel (1987) Représentation de connaissances en calcul propositionnel, thèse, Marseille.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IRISA Campus de Beaulieu, 35042, Rennes Cédex, France

    Philippe Besnard

  2. GIA Université d'Aix-Marseille II, 13288, Marseille Cédex, France

    Pierre Siegel

Authors
  1. Philippe Besnard
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pierre Siegel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ewing Lusk Ross Overbeek

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Besnard, P., Siegel, P. (1988). Supposition-based logic for automated nonmonotonic reasoning. In: Lusk, E., Overbeek, R. (eds) 9th International Conference on Automated Deduction. CADE 1988. Lecture Notes in Computer Science, vol 310. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0012860

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-19343-2

  • Online ISBN: 978-3-540-39216-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation