Skip to main content

Three-Valued Logics for Inconsistency Handling

  • Conference paper
  • First Online:
Logics in Artificial Intelligence (JELIA 2002)

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

Included in the following conference series:

Abstract

While three-valued paraconsistent logic is a valuable framework for reasoning under inconsistency, the corresponding basic inference relation is too cautious and fails in discriminating in a fine-grained way the set of expected consequences of belief bases. To address both issues, we point out more refined inference relations. We analyze them from the logical and computational points of view and we compare them with respect to their relative cautiousness.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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 and A. Avron. Four-valued diagnoses for stratified knowledge-bases. In Proceedings of CSL’96, LNCS 1258, pages 1–17, 1997.

    Google Scholar 

  2. O. Arieli and A. Avron. The value of four values. Artificial Intelligence, 102:97–141, 1998.

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  4. N.D. Belnap.A useful four-valued logic, pages 7–37. Modern Uses of Multiple-Valued Logic. Reidel, 1977.

    Google Scholar 

  5. Ph. Besnard and T. Schaub. Circumscribing inconsistency. In Proceedings of IJCAI’97, pages 150–155, 1997.

    Google Scholar 

  6. M. Cadoli and M. Schaerf. On the complexity of entailment in propositional multivalue d logics. Annals of Mathematics and Artificial Intelligence, 18:29–50, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  7. C. Cayrol and M.-C. Lagasquie-Schiex. Non-monotonic syntax-based entailment: a classification of consequence relations. In Proceedings of ECSQARU’95, LNAI 946, pages 107–114, 1995.

    Google Scholar 

  8. S. Coste-Marquis and P. Marquis. Complexity results for paraconsistent inference relations. In Proceedings of KR’02, pages 61–72, 2002.

    Google Scholar 

  9. I.M.L. D’Ottaviano and N.C.A. da Costa. Sur un problème de Jaśkowski. In Comptes Rendus de l’Académie des Sciences de Paris, volume 270, pages 1349–1353. 1970.

    MATH  Google Scholar 

  10. D. Dubois and H. Prade. Possibility theory, probability theory and multiple-valued logics: A clarification. Annals of Mathematics and Artificial Intelligence, 32:35–66, 2001.

    Article  MathSciNet  Google Scholar 

  11. A.M. Frisch. Inference without chaining. In Proceedings of IJCAI’87, pages 515–519, 1987.

    Google Scholar 

  12. D. M. Gabbay. Theoretical foundations for nonmonotonic reasoning in experts systems. In K. Apt, editor, Logic and Models of Concurrent Systems. Springer Verlag, 1985.

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  14. J. Lang and P. Marquis. Resolving inconsistencies by variable forgetting. In Proceedings of KR’02, pages 239–250, 2002.

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  16. H.J. Levesque. A knowledge-level account of abduction (preliminary version). In Proceedings of IJCAI’89, pages 1061–1067, 1989.

    Google Scholar 

  17. D. Makinson. Handbook of Logic in Artificial Intelligence and Logic Programming, volume III, chapter General Pattern in nonmonotonic reasoning, pages 35–110. Clarendon Press, Oxford, 1994.

    Google Scholar 

  18. P. Marquis and N. Porquet. Resource-bounded inference from inconsistent belief bases. In Proceedings of IJCAI’01, pages 103–108, 2001.

    Google Scholar 

  19. Ch. H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.

    Google Scholar 

  20. G. Priest. Reasoning about truth. Artificial Intelligence, 39:231–244, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  21. G. Priest. Minimally inconsistent LP. Studia Logica, 50:321–331, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  22. E. Sandewall. A functional approach to non-monotonic logic. In Proceedings of IJCAI’85, pages 100–106, 1985.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Konieczny, S., Marquis, P. (2002). Three-Valued Logics for Inconsistency Handling. In: Flesca, S., Greco, S., Ianni, G., Leone, N. (eds) Logics in Artificial Intelligence. JELIA 2002. Lecture Notes in Computer Science(), vol 2424. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45757-7_28

Download citation

  • DOI: https://doi.org/10.1007/3-540-45757-7_28

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45757-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics