Skip to main content
SpringerLink
Log in

A Survey of Paraconsistent Semantics for Logic Programs

  • Chapter
Reasoning with Actual and Potential Contradictions

Part of the book series: Handbook of Defeasible Reasoning and Uncertainty Management Systems ((HAND,volume 2))

Abstract

Our contribution to this volume consists in giving a logic programmer’s view on handling program inconsistency. The semantics we cover will touch several aspects of implementing reasoning in the presence of contradiction. Logic programming has already shown a wide applicability for representings knowledge [Barai and Gel-fond, 1994]. Also, the most important non-monotonic formalisms, for instance Default Logic [Reiter, 1980] and Autoepistemic logics [Moore, 1984; Moore, 1985], have a counterpart semantics on the logic programming side.1 Moreover, logic programming has turned out to be vehicle for implementing and exploring other important aspects of Artificial Intelligence such as updates and belief revision. Therefore, it is not strange that a lot of work in the logic programming community has been carried out to understand the integration of paraconsistent reasoning with logic programming, in preparation for an applicational and implementational rôle of great potential, now emerging.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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. S. Adali and V. S. Subrahmanian. Amalgamating knowledge bases, III: Algorithms, data structures, and query processing. JournalofLogic Programming, 28 (1): 45 – 88, 1996.

    Article  Google Scholar 

  2. Alferes and Pereira, 19961 J. J. Alferes and L. M. Pereira. Reasoning with Logic Programming, volume LNAI 1111. Springer—Verlag, 1996.

    Google Scholar 

  3. Alferes et al.,1995] J. J. Alferes, C. V. Damdsio, and L. M. Pereira. A logic programming system for non-monotonic reasoning. Special Issue of the Journal of Automated Reasoning,14(1): 93–147, 1995.

    Google Scholar 

  4. Alferes et al.,1996] J. J. Alferes, L. M. Pereira, and T. Przymusinski. Strong and explicit negation in non-monotonic reasoning and logic programs. In JELIA’96, European Workshop on Logic in Artificial Intelligence. Springer-Verlag, 1996. An extended version will appear in JAR.

    Google Scholar 

  5. José Júlio Alferes. Semantics of Logic Programs with Explicit Negation. PhD thesis, Universidade Nova de Lisboa, October 1993.

    Google Scholar 

  6. A. Almukdad and D. Nelson. Constructible falsity and inexact predicates. Journal of Symbolic Logic, 49: 231 – 233, 1984.

    Article  Google Scholar 

  7. Joaquim Nunes Aparício. Logic Programming: a tool for reasoning. PhD thesis, Universidade Nova de Lisboa, January 1994.

    Google Scholar 

  8. Apt and Bezem, 1991] K. Apt and M. Bezem. Acyclic programs. New Generation Computing,9(3):335–363,1991. Also appeared in ICLP’90.

    Google Scholar 

  9. K. Apt and R. Bol. Logic programming and negation: A survey. Journal of Logic Programming, 19, 20: 9 – 71, 1994.

    Google Scholar 

  10. C. Baral and M. Gelfond. Logic programming and knowledge representation. Journal of Logic Programming, 19 /20: 73 – 148, 1994.

    Article  Google Scholar 

  11. N. D. Belnap. A useful four-valued logic. In J. M. Dunn and G. Epstein, editors, Modern Uses of Many-valued Logic, pages 8–37. D. Reidel, 1977.

    Google Scholar 

  12. P. Besnard and T. Schaub. Signed systems for paraconsistent reasoning. In J. J. Alferes, L. M. Pereira, and E. Orlowska, editors, Logics in Artificial Intelligence. Proceedings of the European Ws. JELIA’96, volume LNAI 1126, pages 404–416. Springer-Verlag, 1996.

    Google Scholar 

  13. H. A. Blair and V. S. Subrahmanian. Paraconsistent logic programming. Theoretical Computer Science, 68: 135 – 154, 1989.

    Article  Google Scholar 

  14. P. Bonatti. Autoepistemic logics as a unifying framework for the semantics of logic programs. In K. Apt, editor, InternationalJoint Conference and Symposium on Logic Programming, pages 417–430. MIT Press, 1992.

    Google Scholar 

  15. F Bry. Logic programming as constructivism: a formalization and its application to databases. In Proc. of the Eighth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS’89), pages 34 – 50, 1989.

    Chapter  Google Scholar 

  16. F. Bry. Negation in logic programming: a formalization in constructive logic. In Information Systems and Artificial Intelligence: Integration Aspects, pages 30–46. Springer-Verlag, 1990.

    Google Scholar 

  17. F. Bry. A compositional semantics for logic programs and deductive databases. In Proc. Joint International Conference and Symposium on Logic Programming’ 96 (JICSLP’ 96), pages 453–467. The MIT Press, 1996.

    Google Scholar 

  18. N. Costa. On the theory of inconsistency formal system. Notre Dame Journal of Formal Logic, 15: 497 – 510, 1974.

    Article  Google Scholar 

  19. C. V. Damâsio and L. M. Pereira. A model theory for paraconsistent logic programming. In C. Pinto-Ferreira and N. J. Mamede, editors, Progress in Artificial Intelligence - 7th Portuguese Conference on Artificial Intelligence, LNAI 990, pages 377–386. Springer-Verlag, 1995.

    Google Scholar 

  20. C. V. Damâsio and L. M. Pereira. A paraconsistent semantics with contradiction support detection. In J. Dix and A. Nerode, editors, Proceedings of LPNMR’ 97, Lecture Notes in Artificial Intelligence. Springer-Verlag, 1997.

    Google Scholar 

  21. Carlos Viegas Damâsio. Paraconsistent Extended Logic Programming with Constraints. PhD thesis, Universidade Nova de Lisboa, October 1996.

    Google Scholar 

  22. Dix, 1995a1 J. Dix. A Classification-Theory of Semantics of Normal Logic Programs: I. Strong Properties. Fundamenta Informaticae, XXII (3): 227 – 255, 1995.

    Google Scholar 

  23. J. Dix. A Classification-Theory of Semantics of Normal Logic Programs: II. Weak Properties. Fundamenta Informaticae, XXII (3): 257 – 288, 1995.

    Google Scholar 

  24. W. Drabent and M. Martelli. Strict completion of logic programs. New Generation Computing, 9 (1): 69 – 79, 1991.

    Article  Google Scholar 

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

    Article  Google Scholar 

  26. F. Fages. A new fixpoint semantics for general logic programs compared with the well-founded and stable semantics. New Generation Computing, 9: 425 – 443, 1991.

    Article  Google Scholar 

  27. M. Fitting. A Kripke-Kleene semantics for logic programs. Journal of Logic Programming, 2 (4): 295 – 312, 1985.

    Article  Google Scholar 

  28. M. Fitting. Bilattices and the semantics of logic programming. Journal of Logic Programming, 11: 91 – 116, 1991.

    Article  Google Scholar 

  29. M. Fitting. Well-founded semantics, generalized. In Proceedings of ILPS’91, pages 71–84. MIT Press, 1991.

    Google Scholar 

  30. J. Fox, P. Krause, and S. Ambler. Arguments, contradictions and practical reasoning. In B. Neumann, editor, Proceedings ECAI’92, pages 623–627. John Wiley & Sons, 1992.

    Google Scholar 

  31. A. Van Gelder, K. A. Ross, and J. S. Schlipf. The well-founded semantics for general logic programs. Journal of the ACM, 38 (3): 620 – 650, 1991.

    Google Scholar 

  32. A. Van Gelder. The alternating fixpoints of logic programs with negation. In 8th Symposium on Principles of Database Systems. ACM SIGACT-SIGMOD, 1989.

    Google Scholar 

  33. M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In R. Kowalski and K. A. Bowen, editors, 5th International Conference on Logic Programming, pages 1070–1080. MIT Press, 1988.

    Google Scholar 

  34. Gelfond and Lifschitz, 19901 M. Gelfond and V. Lifschitz. Logic programs with classical negation. In Warren and Szeredi, editors, 7th International Conference on Logic Programming, pages 579–597. MIT Press, 1990.

    Google Scholar 

  35. M. Gelfond. On stratified autoepistemic theories. In AAAI’ 87, pages 207–211. Morgan Kaufmann, 1987.

    Google Scholar 

  36. M. L. Ginsberg. Multivalued logics. In Proceedings of AAAP86, pages 243 – 247, 1986.

    Google Scholar 

  37. M. L. Ginsberg. Multivalued logics: a uniform approach to reasoning in artificial intelligence. Computational Intelligence, 4: 265 – 316, 1988.

    Article  Google Scholar 

  38. J. Grant and V. S. Subrahmanian. Reasoning in inconsistent knowledge bases. IEEE Transactions on Knowledge and Data Engineering, 7 (1): 177 – 189, 1995.

    Article  Google Scholar 

  39. J. Grant. Inconsistent and incomplete logics. Mathematics Magazine, 48 (3): 154 – 159, 1975.

    Article  Google Scholar 

  40. J. Grant. Classifications for inconsistent theories. Notre Dame Journal of Formal Logic, XIX: 435 – 444, 1978.

    Article  Google Scholar 

  41. C. M. Jonker and C. Witteveen. Revision by expansion. In G. Lakemeyer and B. Nebel, editors, Proceedings ECM’ 92 Workshop on Theoretical Foundations of Knowledge Representation, pages 40–44. ECAI’92 Press, 1992.

    Google Scholar 

  42. M. Kifer and E. Lozinskii. A logic for reasoning with inconsistency. Journal of Automated Reasoning, 8: 179 – 215, 1992.

    Article  Google Scholar 

  43. M. Kifer and V. Subrahmanian. Theory of generalized annotated logic programming and its applications. Journal of Logic Programming, 12: 335 – 367, 1992.

    Article  Google Scholar 

  44. R. Kowalski and F. Sadri. Logic programs with exceptions. In Warren and Szeredi, editors, ICLP90. MIT Press, 1990.

    Google Scholar 

  45. Krause et al.,1995] P. Krause, S. Ambler, M. Elvang-Goransson, and J. Fox. A logic of argumentation for reasoning under uncertainty. Computational Intelligence, 11(1): 113–131, 1995.

    Google Scholar 

  46. H. Levesque. Making believers out of computers. Artificial Intelligence, 30: 81 – 107, 1986.

    Article  Google Scholar 

  47. H. Levesque. Logic and the complexity of reasoning. Journal of Philosophical Logic, 17: 355 – 389, 1988.

    Article  Google Scholar 

  48. J. Lin. A semantics for reasoning consistently in the presence of inconsistency. Artificial Intelligence, 86: 75 – 95, 1996.

    Article  Google Scholar 

  49. J. Lukasiewicz. Philosophische bemerkungen zu mehrwertigen systemen des aussagenkalküls. Comptes rendus de la Societé des Sciences et Lettres de Varsovie, 23: 51 – 77, 1930.

    Google Scholar 

  50. W. Marek and M. Truszczydski. Nonmonotonic Logic - Context-Dependent Reasoning. Springer-Verlag, 1993.

    Google Scholar 

  51. B. Meltzer. Theorem-proving for computers: some results on resolution and renaming. Automatation of Reasoning, 1: 493 – 495, 1983.

    Article  Google Scholar 

  52. J. Minker and C. Ruiz. Semantics for disjunctive logic programs with explicit and default negation. Fundamenta lnformaticae, 20 (3/4): 145 – 192, 1994.

    Google Scholar 

  53. R. C. Moore. Possible-world semantics for autoepistemic logic. In Proc. MAI Workshop on Non-monotonic Reasoning, pages 396–401, New Paltz, 1984.

    Google Scholar 

  54. R. C. Moore. Semantical considerations on nonmonotonic logic. Artificial Intelligence, 25: 75 – 94, 1985.

    Article  Google Scholar 

  55. S. Naqvi and F. Rossi. Reasoning in inconsistent databases. In Proc. of the 1990 Norht American Conf. on Logic Programming, pages 255–272. The MIT Press, 1990.

    Google Scholar 

  56. D. Nelson. Constructible falsity. Journal of Symbolic Logic, 14: 16 – 26, 1949.

    Article  Google Scholar 

  57. D. Pearce and G. Wagner. Reasoning with negative information I: Strong negation in logic programs. In L. Haaparanta, M. Kusch, and I. Niiniluoto, editors, Language, Knowledge and Intentionality, pages 430–453. Acta Philosophica Fennica 49, 1990.

    Google Scholar 

  58. D. Pearce and G. Wagner. Logic programming with strong negation. In P. Schroeder-Heister, editor, Extensions of Logic Programming, pages 311–326. LNAI 475, Springer-Verlag, 1991.

    Google Scholar 

  59. D. Pearce. Reasoning with Negative Information, II: hard negation, strong negation and logic programs. In D. Pearce and H. Wansing, editors, Nonclassical logic and information processing, number 619 in LNAI, pages 63–79. Springer-Verlag, 1992.

    Google Scholar 

  60. D. Pearce. Answer sets and constructive logic, II: Extended logic programs and related non-monotonic formalisms. In L.M. Pereira and A. Nerode, editors, Logic Programming and Nonmonotonic Reasoning - proceedings of the second international workshop, pages 457–475. MIT Press, 1993.

    Google Scholar 

  61. D. Pearce. Safety, stability and deductive bases. Technical report, DFKI, 1995.

    Google Scholar 

  62. L. M. Pereira and J. J. Alferes. Well-founded semantics for logic programs with explicit negation. In B. Neumann, editor, European Conference on Artificial Intelligence 1992, pages 102–106. John Wiley & Sons, 1992.

    Google Scholar 

  63. Pereira et al.,1991] L. M. Pereira, J. J. Alferes, and J. N. Aparicio. Contradiction Removal within Well-Founded Semantics. In A. Nerode, W. Marek, and V. S. Subrahmanian, editors, Logic Programming and Non-monotonic Reasoning,pages 105–119. MIT Press, 1991.

    Google Scholar 

  64. Pereira et al.,1993a] L. M. Pereira, C. V. Damâsio, and J. J. Alferes. Debugging by diagnosing assumptions. In P. A. Fritzson, editor, Automatic Algorithmic Debugging, AADEBUG’ 93,LNCS 749, pages 58–74. Springer-Verlag, 1993.

    Google Scholar 

  65. Pereira et al.,1993b] L. M. Pereira, C. V. Damâsio, and J. J. Alferes. Diagnosis and debugging as contradiction removal. In L. M. Pereira and A. Nerode, editors, 2nd Int. Workshop on Logic Programming and Non-Monotonic Reasoning,pages 334–348, Lisboa, Portugal, 1993. MIT Press.

    Google Scholar 

  66. Pereira et al.,1993c] L. M. Pereira, C. V. Damâsio, and J. J. Alferes. Diagnosis and debugging as contradiction removal in logic programs. In L. Damas and M. Filgueiras, editors, Progress in Artificial Intelligence. Proceedings of the 6th Portuguese AI Conf,LNAI 727, pages 183–197, Porto, Portugal, 1993. Springer-Verlag.

    Google Scholar 

  67. S. G. Pimentel and W. L. Rodi. Belief revision and paraconsistency in a logic programming framework. In A. Nerode, W. Marek, and V. S. Subrahmanian, editors, Logic Programming and Non-monotonic Reasoning, pages 228–242. MIT Press, 1991.

    Google Scholar 

  68. S. Pradhan. A family of paraconsistent semantics for extended logic programs. Technical report, CS, University of Maryland, 1996.

    Google Scholar 

  69. Priest et al.,1988] G. Priest, R. Routley, and J. Norman. Paraconsistent logics. Philosophia Verlag, 1988.

    Google Scholar 

  70. H. Przymusinska and T. C. Przymusinski. Semantic issues in deductive databases and logic programs. In R. Banerji, editor, Formal Techniques in Artificial Intelligence, a Sourcebook, pages 321–367. North Holland, 1990.

    Google Scholar 

  71. T. C. Przymusinski. On the declarative semantics of stratified deductive databases. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 193–216. Morgan Kaufmann, 1988.

    Google Scholar 

  72. T. C. Przymusinski. Extended stable semantics for normal and disjunctive programs. In Warren and Szeredi, editors, 7th International Conference on Logic Programming, pages 459–477. MIT Press, 1990.

    Google Scholar 

  73. T. C. Przymusinski. Stationary semantics for disjunctive logic programs and deductive databases. In Debray and Hermenegildo, editors, North American Conference on Logic Programming, pages 40–57. MIT Press, 1990.

    Google Scholar 

  74. T. C. Przymusinski. Autoepistemic logic of closed beliefs and logic programming. In A. Nerode, W. Marek, and V. S. Subrahmanian, editors, Logic Programming and Non-monotonic Reasoning, pages 3–20. MIT Press, 1991.

    Google Scholar 

  75. T. C. Przymusinski. Static semantics for normal and disjunctive logic programs. Annals of Mathematics and Artificial Intelligence, 14: 323 – 357, 1995.

    Article  Google Scholar 

  76. N. Rescher and R. Brandom. The logic of inconsistency. Basil Blackwell, 1980.

    Google Scholar 

  77. C. Sakama and K. Inoue. Paraconsistent Stable Semantics for Extended Disjunctive Programs. Journal of Logic and Computation, 5 (3): 265 – 285, 1995.

    Article  Google Scholar 

  78. C. Sakama. Extended well-founded semantics for paraconsistent logic programs. In Fifth Generation Computer Systems, pages 592–599. ICOT, 1992.

    Google Scholar 

  79. C. Sakama. Studies on Disjunctive Logic Programming. PhD thesis, Faculty of Engineering of Kyoto University, July 1994.

    Google Scholar 

  80. Marco Schaerf. Notes on ginsberg’s multivalued logics. Computational Intelligence, 7: 154 – 159, 1991.

    Article  Google Scholar 

  81. J. S. Schlipf. Complexity and undecidability results for logic programming. Annals of Mathematics and Artificial Intelligence, 15 (3,4): 257 – 288, 1995.

    Article  Google Scholar 

  82. J. Shepherdson. Negation in logic programming for general logic programs. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 19–88. Morgan Kaufmann, 1988.

    Google Scholar 

  83. V. S. Subrahmanian. Paraconsistent disjunctive deductive databases. Theoretical Computer Science, 93: 115 – 141, 1992.

    Article  Google Scholar 

  84. F. Teusink. A proof procedure for extended logic programs. In Proc. ILPS’93. MIT Press, 1993.

    Google Scholar 

  85. S. Toulmin. The uses of arguments. Cambridge University Press, 1958.

    Google Scholar 

  86. A. Urquhart. Many-valued logic. In D. Gabbay and F. Guenthner, editors, Handbook of Philosophical Logic, Vol. III„ pages 71–116. D. Reidel Publishing Company, 1986.

    Google Scholar 

  87. G. Wagner. A database needs two kinds of negation. In B. Thalheim, J. Demetrovics, and H-D. Gerhardt, editors, Mathematical Foundations of Database Systems, pages 357–371. LNCS 495, Springer-Verlag, 1991.

    Google Scholar 

  88. G. Wagner. Logic programming with strong negation and inexact predicates. Journal of Logic and Computation, 1 (6): 835 – 859, 1991.

    Article  Google Scholar 

  89. G. Wagner. Reasoning with inconsistency in extended deductive databases. In L. M. Pereira and A. Nerode, editors, 2nd International Workshop on Logic Programming and Non-monotonic Reasoning, pages 300–315. MIT Press, 1993.

    Google Scholar 

  90. G. Wagner. Vivid logic: Knowledge-based reasoning with two kinds of negation. LNAI 764, 1994.

    Google Scholar 

  91. M. Wallace. Tight, consistent, and computable completions for unrestricted logic programs. Journal of Logic Programming, 15: 243 – 273, 1993.

    Article  Google Scholar 

  92. You et al.,1995] Jia-Huai You, Suryanil Ghosh, Li-Yan Yuan, and Randy Goebel. An introspective framework for paraconsistent logic programs. In John W. Lloyd, editor, ILPS95. The MIT Press, 1995.

    Google Scholar 

Download references

Authors
  1. Carlos Viegas Damásio
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Luís Moniz Pereira
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. IRSIA, Rennes, France

    Philippe Besnard

  2. University College, London, UK

    Anthony Hunter

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Damásio, C.V., Pereira, L.M. (1998). A Survey of Paraconsistent Semantics for Logic Programs. In: Besnard, P., Hunter, A. (eds) Reasoning with Actual and Potential Contradictions. Handbook of Defeasible Reasoning and Uncertainty Management Systems, vol 2. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-1739-7_8

Download citation

  • DOI: https://doi.org/10.1007/978-94-017-1739-7_8

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-90-481-5063-2

  • Online ISBN: 978-94-017-1739-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation