Skip to main content
SpringerLink
Log in

For all typical

  • Conference paper
  • First Online:
Symbolic and Quantitative Approaches to Reasoning and Uncertainty (ECSQARU 1995)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 946))

Abstract

In the paper a binary quantifier Πx(ϕ,ψ) is studied. It can be read as ‘typically, ϕ's are ψ's’. After investigating some formal properties of this quantifier, we compare the resulting logic with predicate conditional logic and discuss possible applications of binary quantifiers in formalizing defeasible reasoning.

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.

References

  • Alechina, N.: Binary quantifiers and relational semantics. ILLC Report LP-93-13 (1993), ILLC, Univ. of Amsterdam.

    Google Scholar 

  • Bacchus, F.: Representing and reasoning with probabilistic knowledge. A logical approach to probabilities. Cambridge (Mass.)-London, The MIT Press (1990).

    Google Scholar 

  • Badaloni, S., Zanardo, A.: A high plausibility logic for reasoning with incomplete time-sensitive knowledge. LADSEB-CNR (Italian National Research Council, Institute for Investigations in System Dynamics and Bioengineering), Int.Report 02/90 (1990).

    Google Scholar 

  • Badaloni, S., Zanardo, A.: Typicality for plausible reasoning. In: Trends in Artificial Intelligence. Lecture Notes in Computer Science, Springer Verlag, (1991) 470–474.

    Google Scholar 

  • Delgrande, J. P.: An approach to default reasoning based on a first-order conditional logic: Revised report. Artificial Intelligence 36, (1991) 63–90.

    Google Scholar 

  • Kraus, S., Lehmann, D., Magidor, M.: Nonmonotonic reasoning, preferential models, and cumulative logics. Artificial Intelligence 44 (1990) 167–207.

    Article  Google Scholar 

  • Morreau, M. Conditionals in Philosophy and Artificial Intelligence. PhD Thesis, Univ. of Amsterdam, Amsterdam (1992).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. FWI, University of Amsterdam, Pl. Muidergracht 24, 1018, TV Amsterdam, The Netherlands

    Natasha Alechina

Authors
  1. Natasha Alechina
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Christine Froidevaux Jürg Kohlas

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Alechina, N. (1995). For all typical. In: Froidevaux, C., Kohlas, J. (eds) Symbolic and Quantitative Approaches to Reasoning and Uncertainty. ECSQARU 1995. Lecture Notes in Computer Science, vol 946. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60112-0_1

Download citation

  • DOI: https://doi.org/10.1007/3-540-60112-0_1

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60112-8

  • Online ISBN: 978-3-540-49438-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation