Skip to main content

In All, but Finitely Many, Possible Worlds: Model-Theoretic Investigations on ‘Overwhelming Majority’ Default Conditionals

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

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

Abstract

Defeasible conditionals of the form ‘if A then normally B’ are usually interpreted with the aid of a ‘normality’ ordering between possible states of affairs: \(A\Rightarrow B\) is true if it happens that in the most ‘normal’ (least exceptional) A-worlds, B is also true. Another plausible interpretation of ‘normality’ introduced in nonmonotonic reasoning dictates that \(A\Rightarrow B\) is true iff B is true in ‘mostA-worlds. A formal account of ‘most’ in this majority-based approach to default reasoning has been given through the usage of (weak) filters and (weak) ultrafilters, capturing at least, a basic core of a size-oriented approach to defeasible reasoning. In this paper, we investigate defeasible conditionals constructed upon a notion of ‘overwhelming majority’, defined as ‘truth in a cofinite subset of \(\omega \)’, the first infinite ordinal. One approach employs the modal logic of the frame \((\omega , <)\), used in the temporal logic of discrete linear time. We introduce and investigate conditionals, defined modally over \((\omega , <)\); several modal definitions of the conditional connective are examined, with an emphasis on the nonmonotonic ones. An alternative interpretation of ‘majority’ as sets cofinal (in \(\omega \)) rather than cofinite (subsets of \(\omega \)) is examined. For all these modal approaches over \((\omega , <)\), a decision procedure readily emerges, as the modal logic \(\mathbf {KD4LZ}\) of this frame is well-known and a translation of the conditional sentences can be mechanically checked for validity. A second approach employs the conditional version of Scott-Montague semantics, in the form of \(\omega \), endowed with neighborhoods populated by its cofinite subsets. Again, different conditionals are introduced and examined. Although it is not feasible to obtain a completeness theorem, since it is not easy to capture ‘cofiniteness-in-\(\omega \)’ syntactically, this research reveals the possible structure of ‘overwhelming majority’ conditionals, whose relative strength is compared to (the conditional logic ‘equivalent’ of) KLM logics and other conditional logics in the literature.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Allen, J.F., Fikes, R., Sandewall, E. (eds.) Proceedings of the 2nd International Conference on Principles of Knowledge Representation and Reasoning (KR 1991), 22–25 April 1991. Morgan Kaufmann, Cambridge (1991)

    Google Scholar 

  2. Bell, J.: The logic of nonmonotonicity. Artif. Intell. 41(3), 365–374 (1990)

    Article  MathSciNet  Google Scholar 

  3. Besnard, P., Hunter, A. (eds.) Reasoning with Actual and Potential Contradictions, Handbook of Defeasible Reasoning and Uncertainty Management Systems, vol. 2. Kluwer Academic Publishers, Boston (1998)

    Google Scholar 

  4. Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic. Cambridge Tracts in Theoretical Computer Science, vol. 53. Cambridge University Press, Cambridge (2001)

    Book  MATH  Google Scholar 

  5. Boutilier, C.: Conditional logics of normality: a modal approach. Artif. Intell. 68(1), 87–154 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  6. Delgrande, J.P.: A first-order conditional logic for prototypical properties. Artif. Intell. 33(1), 105–130 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  7. Delgrande, J.P.: An approach to default reasoning based on a first-order conditional logic: revised report. Artif. Intell. 36(1), 63–90 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  8. Delgrande, J.P.: Conditional logics for defeasible reasoning. In: Besnard and Hunter [3], vol. 2, pp. 135–173 (1998)

    Google Scholar 

  9. Delgrande, J.P.: On a rule-based interpretation of default conditionals. Ann. Math. Artif. Intell. 48(3–4), 135–167 (2006)

    MathSciNet  MATH  Google Scholar 

  10. Ginsberg, M.L.: Counterfactuals. Artif. Intell. 30(1), 35–79 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  11. Goldblatt, R.: Logics of Time and Computation. CSLI Lecture Notes, vol. 7, 2nd edn. Center for the Study of Language and Information, Stanford University, Stanford (1992)

    MATH  Google Scholar 

  12. Jauregui, V.: Modalities, conditionals and nonmonotonic reasoning. Ph.D. thesis, Department of Computer Science and Engineering, University of New South Wales (2008)

    Google Scholar 

  13. Koutras, C.D., Rantsoudis, C.: In all, but finitely many, possible worlds: model-theoretic investigations on ‘overwhelming majority’ default conditionals. Technical report, February 2015. http://www.uop.gr/~ckoutras/KR-MajCond-Full.pdf

  14. Kraus, S., Lehmann, D.J., Magidor, M.: Nonmonotonic reasoning, preferential models and cumulative logics. Artif. Intell. 44(1–2), 167–207 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  15. Lamarre, P.: S4 as the conditional logic of nonmonotonicity. In: Allen et al. [1], pp. 357–367

    Google Scholar 

  16. Lehmann, D.J., Magidor, M.: What does a conditional knowledge base entail? Artif. Intell. 55(1), 1–60 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  17. Lewis, D.K.: Counterfactuals. Blackwell, Oxford (1973)

    MATH  Google Scholar 

  18. Nute, D.: Topics in Conditional Logic. Kluwer, Boston (1980)

    Book  MATH  Google Scholar 

  19. Olivetti, N., Pozzato, G.L., Schwind, C.: A sequent calculus and a theorem prover for standard conditional logics. ACM Trans. Comput. Logic 8(4), 427–473 (2007)

    Article  MathSciNet  Google Scholar 

  20. Schlechta, K.: Defaults as generalized quantifiers. J. Logic Comput. 5(4), 473–494 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  21. Schlechta, K.: Filters and partial orders. Logic J. IGPL 5(5), 753–772 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  22. Segerberg, K.: Modal logics with linear alternative relations. Theoria 36, 301–322 (1970)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Costas D. Koutras .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Koutras, C.D., Rantsoudis, C. (2015). In All, but Finitely Many, Possible Worlds: Model-Theoretic Investigations on ‘Overwhelming Majority’ Default Conditionals. In: Destercke, S., Denoeux, T. (eds) Symbolic and Quantitative Approaches to Reasoning with Uncertainty. ECSQARU 2015. Lecture Notes in Computer Science(), vol 9161. Springer, Cham. https://doi.org/10.1007/978-3-319-20807-7_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-20807-7_11

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-20806-0

  • Online ISBN: 978-3-319-20807-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics