Skip to main content

Paraconsistency and beyond: A new approach to inconsistency handling

  • Communications
  • Conference paper
  • First Online:

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

Abstract

The expressive power of positive logic programs is enhanced by explicit negation by providing a natural and unambiguous way to assert negated information. But by this, we are faced with the problem of dealing with contradictions in the database. The ECSQ (for ‘ex contradictione sequitir quodlibet’) approach of classical logic, by which everything follows from a contradiction, thus resulting in the collapsing (or trivialization) of the system is certainly not a pragmatic approach towards handling inconsistency. We propose an inconsistency handling concept — explicit paraconsistency, formalized as Approach C, which is close in spirit to ‘paraconsistent’ approaches known from the logicophilosophical literature on non-classical logics handling inconsistency. Furthermore, our approach goes beyond the paraconsistent horizon i.e. allowing nontrivial reasoning in presence of inconsistency. We allow reasoning from inconsistent information, keep track of conclusions inferred from inconsistent premises and propagate a new horizon of reasoning involving elements ‘affected’ by inconsistency. This we call reasoning beyond paraconsistency and formalize as Approach C d.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Carlos E. Alchourron, Peter Gardenfors, and David Makinson. On the logic of theory change: Partial meet contraction and revision functions. Symbolic Logic, 50(2):510–530, June, 1985.

    Google Scholar 

  2. H. Blair and V. S. Subrahmanian. Paraconsistent logic programming. Theoretical Computing Science, 68:135–154, 1989.

    Google Scholar 

  3. L. Clark. Negation as failure. In H. Gallaire and J. Minker, editors, Logics and Data Bases, pages 293–322. Plenum Press, New York, 1978.

    Google Scholar 

  4. M. Van Emden and R. Kowalski. The semantics of predicate logic as a programming language. Journal of ACM, 23(4):37–54, 1976.

    Google Scholar 

  5. Dov Gabbay and Anthony Hunter. Making inconsistency respectable: A logical framework for inconsistency in reasoning, part i — a position paper. In Lecture Notes in Artificial Intelligence (535), Proceedings of the International Workshop FAIR-91, pages 19–32. Springer-Verlag, 1991.

    Google Scholar 

  6. M. Gelfond and V. Lifschitz. Logic programs with classical negation. In Proceedings of the 7th. International Conference on Logic Programming, pages 579–597. MIT Press, 1990.

    Google Scholar 

  7. Suryanil Ghosh. Applying Approach CC d to Extended Logic Programs. manuscript, 1994. Dept. of Computing Science, University of Alberta.

    Google Scholar 

  8. Suryanil Ghosh. Approach CC d: A new contradiction handling strategy. manuscript, 1994. Dept. of Computing Science, University of Alberta, Canada.

    Google Scholar 

  9. Suryanil Ghosh. Approach CC d: A new contradiction handling strategy & Extended Logic Programs. In Proceedings of the Third Golden West International Conference on Intelligent Systems. Kluwer Academic Press, June 6–8 1994.

    Google Scholar 

  10. Suryanil Ghosh. Paraconsistency and beyond: Issues and approaches in reasoning. manuscript of Ph.D. thesis (in preparation), 1994. Dept. of Computing Science, University of Alberta, Canada.

    Google Scholar 

  11. J. Lloyd. Foundations of Logic Programming. Springer-Verlag, 1987.

    Google Scholar 

  12. Jack Minker and Carolina Ruiz. On extended disjunctive logic programs. In J. Komorowski and Z. W. Ras, editors, Proceedings of the Seventh International Symposium on Methodologies for Intelligent Systems, pages 1–18. Springer-Verlag, 1993. Lecture notes in AI, June 1993.

    Google Scholar 

  13. Tarcisio Pequeno and Arthur Buchsbaum. The logic of epistemic inconsistency. In Proc. of Second Intl. Conference of Principles of Knowledge Representation and Reasoning, pages 453–460. Morgan Kaufmann, 1991.

    Google Scholar 

  14. L. M. Pereira, J. J. Alferes, and J. N. Aparicio. Contradiction removal within well founded semantics. In Proceedings, 1st. Intl. Workshop on Logic Programming and Nonmonotonic reasoning. MIT Press, July, 1991.

    Google Scholar 

  15. S. G. Pimentel and W. L. Rodi. Belief revision and paraconsistency in a logic programming framework. In Proceedings, 1st. Intl. Workshop on Logic Programming and Nonmonotonic reasoning. MIT Press, July, 1991.

    Google Scholar 

  16. R. Reiter. On closed-world databases. In H. Gallaire and J. Minker, editors, Logic and Data Bases, pages 55–76. Plenum Press, New York, 1978.

    Google Scholar 

  17. Gerd Wagner. Reasoning with inconsistency in extended deductive databases. In Proc. of the 2nd. Intl. Workshop of Logic Programming and Nonmonotonic Reasoning, Lisbon, Portugal, pages 300–315. MIT Press, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Zbigniew W. Raś Maria Zemankova

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ghosh, S. (1994). Paraconsistency and beyond: A new approach to inconsistency handling. In: Raś, Z.W., Zemankova, M. (eds) Methodologies for Intelligent Systems. ISMIS 1994. Lecture Notes in Computer Science, vol 869. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58495-1_53

Download citation

  • DOI: https://doi.org/10.1007/3-540-58495-1_53

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58495-7

  • Online ISBN: 978-3-540-49010-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics