Typicality for plausible reasoning

  • Silvana Badaloni
  • Alberto Zanardo
Short Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 549)


We describe the key ideas of an approach to non-monotonic reasoning (HP-logic) involving an implicit notion of typicality. In this framework, the problem of irrelevant information is addressed and the deductive power and the reliability of the system are compared with those of the Circumscription approach to non-monotonic reasoning.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Badaloni and Zanardo 91].
    S. Badaloni, A. Zanardo: A High Plausibility Logic for Reasoning with Incomplete Knowledge, submitted to the J. of Philosophical Logic for publication, 1991.Google Scholar
  2. [van Benthem 86].
    J. van Benthem: Essays in Logical Semantics, D. Reidel Publishing Company, Dordrecht, 1986.Google Scholar
  3. [Mc Carthy 80].
    J. Mc Carthy: Circumscription — a form of non-monotonic reasoning, Artificial Intelligence, 13:1–2, 1980, pp. 27–39.Google Scholar
  4. [Mc Carthy 86].
    J. Mc Carthy: Application of Circumscription to Formalize Common-sense Reasoning, Artificial Intelligence, 28, 1986, pp. 89–116.Google Scholar
  5. [Pearl 89].
    J. Pearl: Probabilistic Semantics for Nonmonotonic Reasoning: a Survey, Proc. of the 1st Int. Conf. on Principles of Knowledge Representation and Reasoning, Toronto, Canada, 1989.Google Scholar
  6. [Reiter 87].
    E. Reiter: Non monotonic Reasoning, Annual Review of Computer Science, Vol.2, 1987, pp.147–186.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Silvana Badaloni
    • 1
  • Alberto Zanardo
    • 2
  1. 1.Dipartimento di Elettronica e InformaticaPadova
  2. 2.Dipartimento di Matematica Pura ed ApplicataPadova

Personalised recommendations