Skip to main content

Supraclassical Consequence Relations

Tolerating Rare Counterexamples

  • Conference paper
AI 2013: Advances in Artificial Intelligence (AI 2013)

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

Included in the following conference series:

  • 2595 Accesses

Abstract

We explore a family of supraclassical consequence relations obtained by varying the criteria according to which counterexamples to classical entailment may be deemed tolerable. This provides a different perspective on the rational consequence relations of nonmonotonic logic, as well as introducing new kinds of entailment with a diversity of potential contextual applications.

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Britz, K., Heidema, J., Labuschagne, W.: Semantics for dual preferential entailment. Journal of Philosophical Logic 38, 433–446 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  2. Britz, K., Heidema, J., Varzinczak, I.: Constrained consequence. Logica Universalis 5, 327–350 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  3. Freund, M.: On the notion of concept I. Artificial Intelligence 172, 570–590 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  4. Freund, M.: On the notion of concept II. Artificial Intelligence 173, 167–179 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  5. Hauser, N., Kloesel, C.: The Essential Peirce, vol. 1, pp. 1867–1893. Indiana University Press, Bloomington (1992)

    Google Scholar 

  6. Hauser, N., Kloesel, C.: The Essential Peirce, vol. 2, pp. 1893–1913. Indiana University Press, Bloomington (1998)

    Google Scholar 

  7. Johnson-Laird, P.: Mental Models. Harvard University Press, Cambridge (1983)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  9. Lehmann, D., Magidor, M.: What does a conditional knowledge base entail? Artificial Intelligence 55, 1–60 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  10. Rodrigues, C.T.: The method of scientific discovery in Peirce’s philosophy: Deduction, induction, and abduction. Logica Universalis 5, 127–164 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  11. Shoham, Y.: Reasoning about change: Time and causation from the standpoint of artificial intelligence. The MIT Press, Cambridge (1988)

    Google Scholar 

  12. van Benthem, J.: Logic and reasoning: Do the facts matter? Studia Logica 88, 67–84 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  13. Zhang, D., et al.: Nonmonotonic reasoning and multiple belief revision. In: Proceedings IJCAI 1997, vol. 1, pp. 95–100. Morgan Kaufmann, Los Altos (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer International Publishing Switzerland

About this paper

Cite this paper

Labuschagne, W., Heidema, J., Britz, K. (2013). Supraclassical Consequence Relations. In: Cranefield, S., Nayak, A. (eds) AI 2013: Advances in Artificial Intelligence. AI 2013. Lecture Notes in Computer Science(), vol 8272. Springer, Cham. https://doi.org/10.1007/978-3-319-03680-9_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-03680-9_34

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-03679-3

  • Online ISBN: 978-3-319-03680-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics