Skip to main content
Log in

A dissimilarity-based framework for generating inconsistency-tolerant logics

  • Published:
Annals of Mathematics and Artificial Intelligence Aims and scope Submit manuscript

Abstract

Many commonly used logics, including classical logic and intuitionistic logic, are trivialized in the presence of inconsistency, in the sense that inconsistent premises cause the derivation of any formula. It is thus often useful to define inconsistency-tolerant variants of such logics, which are faithful to the original logic with respect to consistent theories but also allow for nontrivial inconsistent theories. A common way of doing so is by incorporating distance-based considerations for concrete logics. So far this has been done mostly in the context of two-valued semantics. Our purpose in this paper is to show that inconsistency-tolerance can be achieved for any logic that is based on a denotational semantics. For this, we need to trade distances for the more general notion of dissimilarities. We then examine the basic properties of the entailment relations that are obtained and exemplify dissimilarity-based reasoning in various forms of denotational semantics, including multi-valued semantics, non-deterministic semantics, and possible-worlds (Kripke-style) semantics. Moreover, we show that our approach can be viewed as an extension of several well-studied forms of reasoning in the context of belief revision, database integration, consistent query answering, and inconsistency maintenance in knowledge-based systems.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Arenas, M., Bertossi, L., Chomicki, J.: Consistent query answers in inconsistent databases. In: Proc. PODS’99, pp. 68–79. ACM Press (1999)

  2. Arieli, O.: Distance-based paraconsistent logics. Int. J. Approx. Reason. 48(3), 766–783 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  3. Arieli, O., Avron, A.: General patterns for nonmonotonic reasoning: from basic entailments to plausible relations. Log. J. IGPL 8(2), 119–148 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  4. Arieli, O., Avron, A., Zamansky, A.: Ideal paraconsistent logics. Stud. Log. 99(1–3), 31–60 (2011)

    MATH  MathSciNet  Google Scholar 

  5. Arieli, O., Denecker, M., Bruynooghe, M.: Distance semantics for database repair. Ann. Math. Artif. Intell. 50(3–4), 389–415 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  6. Arieli, O., Zamansky, A.: Distance-based non-deterministic semantics for reasoning with uncertainty. Log. J. IGPL 17(4), 325–350 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  7. Arieli, O., Zamansky, A.: Similarity-based inconsistency-tolerant logics. In: Janhunen, T., and Niemelä, I. (eds.) Proc. JELIA’10. LNAI, vol. 6341, pp. 11–23. Springer (2010)

  8. Arieli, O., Zamansky, A.: Simplified forms of computerized reasoning with distance semantics. Journal of Applied Logic 9(1), 1–22 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  9. Arieli, O., Zamansky, A.: Inconsistency-tolerance in knowledge-based systems by dissimilarities. In: Lukasiewicz, Th., Sali, A. (eds.) Proc. FoIKS’12. LNCS, vol. 7153, pp. 34–50. Springer (2012)

  10. Avron, A., Konikowska, B.: Proof systems for reasoning about computation errors. Stud. Log. 91(2), 273–293 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  11. Avron, A., Lev, I.: Non-deterministic multi-valued structures. J. Log. Comput. 15, 241–261 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  12. Avron, A., Zamansky, A.: Non-deterministic semantics for logical systems. In: Handbook of Philosophical Logic, vol. 16, pp. 227–304 (2011)

  13. Bertossi, L.: Consistent query answering in databases. SIGMOD Rec. 35(2), 68–76 (2006)

    Article  Google Scholar 

  14. Béziau, J.Y., Carnielli, W.A., Gabbay, D.: Handbook of Paraconsistency. King’s College Publications (2007)

  15. Biskup, J., Tadros, C.: Revising belief without revealing secrets. In: Lukasiewicz, Th., Sali, A. (eds.) Proc. FoIKS’12. LNCS, vol. 7153, pp. 51–70. Springer (2012)

  16. Carnielli, W.A., Congilio, M.E., D’Ottaviano, I.: Paraconsistency: the logical way to the inconsistent. In: Proceedings of the Second World Congress on Paraconsistency. Marcel Dekker (2001)

  17. da Costa, N.C.A.: On the theory of inconsistent formal systems. Notre Dame J. Form. Log. 15, 497–510 (1974)

    Article  MATH  Google Scholar 

  18. Dalal, M.: Investigations into a theory of knowledge base revision. In: Proc. AAAI’88, pp. 475–479. AAAI Press (1988)

  19. de Amo, S., Carnielli, W., Marcos, J.: A logical framework for integrating inconsistent information in multiple databases. In: Proc. FoIKS’02. LNCS, vol. 2284, pp. 67–84. Springer (2002)

  20. Fitting, M.: Many-valued modal logics. Fundam. Inform. 15(3–4), 235–254 (1991)

    MATH  MathSciNet  Google Scholar 

  21. Gabbay, D.: Theoretical foundation for non-monotonic reasoning, Part II: structured non-monotonic theories. In: Mayoh, B. (ed.) Proc. SCAI’91. IOS Press (1991)

  22. Gorogiannis, N., Hunter, A.: Implementing semantic merging operators using binary decision diagrams. Int. J. Approx. Reason. 49(1), 234–251 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  23. Gottwald, S.: A treatise on many-valued logics, studies in logic and computation, vol. 9. Research Studies Press, Baldock (2001)

    Google Scholar 

  24. Hunter, A., Konieczny, S.: Approaches to measuring inconsistent information. In: Bertossi, L., Hunter, A., Schaub, T. (ed.) Inconsistency Tolerance. Lecture Notes in Computer Science, vol. 3300, pp. 191–236. Springer (2005)

  25. Hunter, A., Konieczny, S.: Measuring inconsistency through minimal inconsistent sets. In: Proc. KR’08, pp. 358–366. AAAI Press (2008)

  26. Kleene, S.C.: Introduction to Metamathematics. Van Nostrand (1950)

  27. Konieczny, S., Lang, J., Marquis, P.: Distance-based merging: a general framework and some complexity results. In: Proc. KR’02, pp. 97–108. Morgan Kaufmann Publishers (2002)

  28. Konieczny, S., Marquis, P.: Three-valued logics for inconsistency handling. In: Proc. JELIA’02, pp. 332–344 (2002)

  29. Konieczny, S., Pino Pérez, R.: Merging information under constraints: a logical framework. J. Log. Comput. 12(5), 773–808 (2002)

    Article  MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  31. Lafage, C., Lang, J.: Propositional distances and preference representation. In: Proc. ECSQARU’01. LNAI, vol. 2143, pp. 48–59. Springer (2001)

  32. Lang, J., Marquis, P.: Reasoning under inconsistency: a forgetting-based approach. Artif. Intell. 174(12–13), 799–823 (2010)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  34. Lehmann, D., Magidor, M., Schlechta, K.: Distance semantics for belief revision. J. Symb. Log. 66(1), 295–317 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  35. Lin, F., Reiter, R.: Forget it! In: Proc. AAAI Fall Symposium on Relevance, pp. 154–159 (1994)

  36. Lin, J., Mendelzon, A.O.: Knowledge base merging by majority. In: Dynamic Worlds: From the Frame Problem to Knowledge Management. Kluwer (1999)

  37. Lopatenko, A., Bertossi, L.: Complexity of consistent query answering in databases under cardinality-based and incremental repair semantics. In: Proc. ICDT’07. LNCS, vol. 4353, pp. 179–193. Springer (2007)

  38. Makinson, D.: General patterns in nonmonotonic reasoning. In: Gabbay, D., Hogger, C., Robinson, J. (eds.) Handbook of Logic in Artificial Intelligence and Logic Programming, vol. 3, pp. 35–110 (1994)

  39. Malinowski, G.: Many-Valued Logics. Clarendon Press (1993)

  40. McCarthy, J.: A basis for a mathematical theory of computation. Computer Programming and Formal Systems, pp. 33–70 (1963)

  41. McCarthy, J.: Circumscription—a form of non monotonic reasoning. Artif. Intell. 13(1–2), 27–39 (1980)

    Article  MATH  Google Scholar 

  42. Priest, G.: Reasoning about truth. Artif. Intell. 39, 231–244 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  43. Priest, G.: Paraconsistent logic. In: Gabbay, D., Guenthner, F. (eds.) Handbook of Philosophical Logic, vol. 6, pp. 287–393. Kluwer (2002)

  44. Rogers, H.: Theory of Recursive Functions and Effective Computability. McGraw-Hill (1967)

  45. Shoham, Y.: Reasoning about Change. MIT Press (1988)

  46. Spohn, W.: Ordinal conditional functions: a dynamic theory of epistemic states. In: Harper, W.L., Skyrms, B. (eds.) Belief Change and Statistics, vol. II, pp. 105–134. Kluwer (1988)

  47. Staworko, S., Chomicki, J., Marcinkowski, J.: Prioritized repairing and consistent query answering in relational databases. Ann. Math. Artif. Intell., 64(2–3), 209–246 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  48. Subrahmanian, V.S., Amgoud, L.: A general framework for reasoning about inconsistency. In: Veloso, M. (ed.) Proc. IJCAI’07, pp. 599–504 (2007)

  49. Urquhart, A.: Many-valued logic. In: Gabbay, D., Guenthner, F. (eds.) Handbook of Philosophical Logic, vol. II, pp. 249–295. Kluwer (2001)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ofer Arieli.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Arieli, O., Zamansky, A. A dissimilarity-based framework for generating inconsistency-tolerant logics. Ann Math Artif Intell 73, 47–73 (2015). https://doi.org/10.1007/s10472-013-9333-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10472-013-9333-2

Keywords

Mathematics Subject Classifications (2010)

Navigation