Skip to main content
SpringerLink
Log in

Nonmonotonic and Paraconsistent Reasoning: From Basic Entailments to Plausible Relations

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

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

Abstract

In this paper we develop frameworks for logical systems which are able to reflect not only nonmonotonic patterns of reasoning, but also paraconsistent reasoning. For this we consider a sequence of generalizations of the pioneering works of Gabbay, Kraus, Lehmann, Magidor and Makinson. Our sequence of frameworks culminates in what we call plausible, nonmonotonic, multiple-conclusion consequence relations (which are based on a given monotonic one). Our study yields intuitive justifications for conditions that have been proposed in previous frameworks, and also clarifies the connections among some of these systems. In addition, we present a general method for constructing plausible nonmonotonic relations. This method is based on a multiple-valued semantics, and on Shoham’s idea of preferential models.

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

Access this chapter

Log in via an institution
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. O. Arieli, A. Avron. Reasoning with logical bilattices. Journal of Logic, Language, and Information 5(1), pp.25–63, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  2. O. Arieli, A. Avron. The value of the four values. Artificial Intelligence 102(1), pp.97–141, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  3. A. Avron. Simple consequence relations. Journal of Information and Computation 92, pp.105–139, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  4. P. Besnard. Axiomatizations in the metatheory of non-monotonic inference systems. Proc. of the 7th Canadian AI Conference, (R. Goebel-Ed.), Edmonton, Canada, pp.117–124, 1988.

    Google Scholar 

  5. N.C.A. da-Costa. On the theory of inconsistent formal systems. Notre Damm Journal of Formal Logic 15, pp.497–510, 1974.

    Article  MATH  Google Scholar 

  6. M. Freund, D. Lehmann, P. Morris. Rationality, transitivity and Contraposition. Artificial Intelligence 52,pp 191–203,1991.

    Article  MATH  MathSciNet  Google Scholar 

  7. D.M. Gabbay. Theoretical foundation for non-monotonic reasoning in expert systems. Proc. of the NATO Advanced Study Inst. on Logic and Models of Concurent Systems (K.P. Apt-Ed.) Springer, pp.439457, 1985.

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  9. D. Lehmann. Plausibility logic. Proc. CSL’91, pp.227–241,Springer,1992.

    Google Scholar 

  10. D. Lehmann. Nonmonotonic logics and semantics. Technical report TR-98-6, Institute of Computer Science, The Hebrew University, 1998.

    Google Scholar 

  11. D. Lehmann, M. Magidor. What does a conditional knowledge base entail? Artificial Intelligence 55, p.1–60, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  12. D. Makinson. General theory of cumulative inference. Non-Monotonic Reasoning (M. Reinfrank-Ed.), LNAI 346, pp.1–18, Springer, 1989.

    Google Scholar 

  13. D. Makinson. General patterns in nonmonotonic reasoning. Handbook of Logic in Artificial Intelligence and Logic Programming, Vol.3 (D. Gabbay, C. Hogger, J. Robinson-Eds.), Oxford Science Pub., pp.35–110, 1994.

    Google Scholar 

  14. J.M. McCarthy. Circumscription-A form of non monotonic reqsoning. Artificial Intelligence 13(1-2), pp.27–39, 1980.

    Article  MATH  MathSciNet  Google Scholar 

  15. G. Priest. Reasoning about truth. Artificial Intelligence 39, pp.231–244, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  16. G. Priest. Minimally inconsistent LP. Studia Logica 50, pp.321–331, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  17. R. Reiter. On closed world databases. Logic and Databases (H. Gallaire, J. Minker-Eds.), Plenum Press, pp.55–76, 1978.

    Google Scholar 

  18. K. Schlechta.Nonmonotonic logics-Basic concepts, results, and techniques. LNAI 1187, Springer, 1996.

    Google Scholar 

  19. D. Scott. Rules and derived rules. Logical Theory and Semantical Analysis (S. Stenlund-Ed.), Reidel, Dordrecht, pp.147–161, 1974.

    Google Scholar 

  20. D. Scott. Completeness and axiomatization in many-valued logic. Proc. of the Tarski Symposium, Proc. of Symposia in Pure Mathematics, Vol.XXV, American Mathematical Society, Rhode Island, pp.411–435, 1974.

    Google Scholar 

  21. Y. Shoham. Reasoning about change. MIT Press, 1988.

    Google Scholar 

  22. A. Tarski. Introduction to logic. Oxford University Press, N.Y., 1941.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, School of Mathematical Sciences, Tel-Aviv University, Tel-Aviv 69978, Israel

    Ofer Arieli & Arnon Avron

Authors
  1. Ofer Arieli
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Arnon Avron
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University College London, Gower Street, WC1E 6BT, London, UK

    Anthony Hunter

  2. Department of Electronic Engineering, University of London, Queen Mary and Westfield College, E1 4NS, London, UK

    Simon Parsons

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Arieli, O., Avron, A. (1999). Nonmonotonic and Paraconsistent Reasoning: From Basic Entailments to Plausible Relations. In: Hunter, A., Parsons, S. (eds) Symbolic and Quantitative Approaches to Reasoning and Uncertainty. ECSQARU 1999. Lecture Notes in Computer Science(), vol 1638. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48747-6_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-48747-6_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66131-3

  • Online ISBN: 978-3-540-48747-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation