Skip to main content
Springer Nature Link
Log in

Strong and explicit negation in non-monotonic reasoning and logic programming

  • Nonmonotonic Reasoning
  • Conference paper
  • First Online:
Logics in Artificial Intelligence (JELIA 1996)

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

Included in the following conference series:

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Alferes, L. Pereira, and T. C. Przymusinski. Belief revision in logic programming and non-monotonic reasoning. In Progress in AI, Proceedings of the International Artificial Intelligence Conference, EPIA '95, pages 41–56, 1995.

    Google Scholar 

  2. J. J. Alferes, C. V. Damásio, and L. M. Pereira. SLX — A top-down derivation procedure for programs with explicit negation. In M. Bruynooghe, editor, International Symposium on Logic programming. MIT Press, 1994.

    Google Scholar 

  3. J. J. Alferes and L. M. Pereira. On logic program semantics with two kinds of negation. In K. Apt, editor, Int. Joint Conf. and Symp. on LP. MIT Press, 1992.

    Google Scholar 

  4. J. J. Alferes and L. M. Pereira. Contradiction: when avoidance equal removal. In R. Dyckhoff, editor, 4th Int. Ws. on Extensions of LP, volume 798 of LNAI. Springer-Verlag, 1994.

    Google Scholar 

  5. J. J. Alferes, L. M. Pereira, and T. C. Przymusinski. “Classical” negation in non monotonic reasoning and logic programming. In H. Kautz and B. Selman, editors, 4th Int. Symposium on Artificial Intelligence and Mathematics. Florida Atlantic University, 1996.

    Google Scholar 

  6. Stefan Brass, Juergen Dix, and Teodor C. Przymusinski. Characterizations and implementation of static semantics of disjunctive programs. (In preparation), University of California at Riverside, 1996.

    Google Scholar 

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

    Google Scholar 

  8. C. V. Damásio, W. Nejdl, L. M. Pereira, and M. Schroeder. Model-based diagnosis preferences and strategies representation with logic meta-programming. In K. Apt and F.Turini, editors, Meta-logics and Logic Programming, pages 311–338. MIT Press, 1995.

    Google Scholar 

  9. C. V. Damásio and L. M. Pereira. Abduction over 3-valued extended logic programs. In V. Marek, A. Nerode, and M. Truszczynski, editors, Proceedings of the Third International Conference on Logic Programming and Non-Monotonic Reasoning. LPNMR'95, Springer-Verlag, 1995.

    Google Scholar 

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

    Google Scholar 

  11. P. M. Dung and P. Ruamviboonsuk. Well founded reasoning with classical negation. In A. Nerode, W. Marek, and V. S. Subrahmanian, editors, LP & NMR, pages 120–132. MIT Press, 1991.

    Google Scholar 

  12. 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 

  13. M. Gelfond. Logic programming and reasoning with incomplete information. Technical report, University of Texas at El Paso, 1992.

    Google Scholar 

  14. M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In R. Kowalski and K. Bowen, editors, Proceedings of the Fifth Logic Programming Symposium, pages 1070–1080, Cambridge, Mass., 1988. Association for Logic Programming, MIT Press.

    Google Scholar 

  15. M. Gelfond and V. Lifschitz. Logic programs with classical negation. In Proceedings of the Seventh International Logic Programming Conference, Jerusalem, Israel, pages 579–597, Cambridge, Mass., 1990. Association for Logic Programming. MIT Press.

    Google Scholar 

  16. Michael Gelfond, Halina Przymusinski, and Teodor C. Przymusinski. On the relationship between circumscription and negation as failure. Journal of Artificial Intelligence, 38(1):75–94, February 1989.

    Article  Google Scholar 

  17. J. McCarthy. Circumscription — a form of non-monotonic reasoning. Journal of Artificial Intelligence, 13:27–39, 1980.

    Article  Google Scholar 

  18. J. Minker. On indefinite data bases and the closed world assumption. In Proc. 6-th Conference on Automated Deduction, pages 292–308. Springer Verlag, 1982.

    Google Scholar 

  19. R.C. Moore. Semantic considerations on non-monotonic logic. Journal of Artificial Intelligence, 25:75–94, 1985.

    Article  Google Scholar 

  20. D. Nelson. Constructible falsity. JSL, 14:16–26, 1949.

    Google Scholar 

  21. D. Pearce. Reasoning with negative information II: Hard negation, strong negation and logic programs. In D. Pearce and H. Wansing, editors, Nonclassical Logics and Information Processing, pages 63–79. Springer-Verlag, 1990.

    Google Scholar 

  22. 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 

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

    Google Scholar 

  24. L. M. Pereira, J. N. Aparício, and J. J. Alferes. Non-monotonic reasoning with logic programming. Journal of Logic Programming. Special issue on Nonmonotonic reasoning, 17(2, 3 & 4):227–263, 1993.

    Google Scholar 

  25. L. M. Pereira, C. Damásio, and J. J. Alferes. Debugging by diagnosing assumptions. In P. A. Fritzson, editor, Automatic Algorithmic Debugging, AADEBUG'93, volume 749 of Lecture Notes in Computer Science, pages 58–74. Springer-Verlag, 1993.

    Google Scholar 

  26. L. M. Pereira, C. Damásio, and J. J. Alferes. Diagnosis and debugging as contradiction removal. In L. M. Pereira and A. Nerode, editors, 2nd Int. Ws. on LP & NMR, pages 316–330. MIT Press, 1993.

    Google Scholar 

  27. T. C. Przymusinski. The well-founded semantics coincides with the three-valued stable semantics. Fundamenta Informaticae, 13(4):445–464, 1990.

    Google Scholar 

  28. T. C. Przymusinski. Stable semantics for disjunctive programs. New Generation Computing Journal, 9:401–424, 1991. (Extended abstract appeared in: Extended stable semantics for normal and disjunctive logic programs. Proceedings of the 74th International Logic Programming Conference, Jerusalem, pages 459–477, 1990. MIT Press.).

    Google Scholar 

  29. T. C. Przymusinski. Autoepistemic logic of knowledge and beliefs. (In preparation), University of California at Riverside, 1995. (Extended abstract appeared in ‘A knowledge representation framework based on autoepistemic logic of minimal beliefs’ In Proceedings of the Twelfth National Conference on Artificial Intelligence, AAAI-94, Seattle, Washington, August 1994, pages 952–959, Los Altos, CA, 1994. American Association for Artificial Intelligence, Morgan Kaufmann.).

    Google Scholar 

  30. T. C. Przymusinski. Static semantics for normal and disjunctive logic programs. Annals of Mathematics and Artificial Intelligence, Special Issue on Disjunctive Programs(14):323–357, 1995.

    Google Scholar 

  31. Teodor Przymusinski. Semantics of normal and disjunctive logic programs: A unifying framework. In J. Dix, L. Pereira, and T. Przymusinski, editors, Proceedings of the Workshop on Non-Monotonic Extensions of Logic Programming at the Eleventh International Logic Programming Conference, ICLP '95, Santa Margherita Ligure, Italy, June 1994, pages 43–67. Springer Verlag, 1995.

    Google Scholar 

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

    Google Scholar 

  33. R. Reiter. A logic for default theory. Journal of Artificial Intelligence, 13:81–132, 1980.

    Article  Google Scholar 

  34. A. Van Gelder, K. A. Ross, and J. S. Schlipf. The well-founded semantics for general logic programs. Journal of the ACM, 1990. (to appear). Preliminary abstract appeared in Seventh ACM Symposium on Principles of Database Systems, March 1988, pp. 221–230.

    Google Scholar 

  35. G. Wagner. Reasoning with inconsistency in extended deductive databases. In L. M. Pereira and A. Nerode, editors, 2nd Int. Ws. on LP & NMR, pages 300–315. MIT Press, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. DM, U. Évora and CITIA, U. Nova de Lisboa, 2825, Monte da Caparica, Portugal

    José Júlio Alferes

  2. DCS and CITIA, U.Nova de Lisboa, 2825, Monte da Caparica, Portugal

    Luís Moniz Pereira

  3. Dep. of Computer Science, University of California, 92521, Riverside, CA, USA

    Teodor C. Przymusinski

Authors
  1. José Júlio Alferes
    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

  3. Teodor C. Przymusinski
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

José Jülio Alferes Luís Moniz Pereira Ewa Orlowska

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Alferes, J.J., Pereira, L.M., Przymusinski, T.C. (1996). Strong and explicit negation in non-monotonic reasoning and logic programming. In: Alferes, J.J., Pereira, L.M., Orlowska, E. (eds) Logics in Artificial Intelligence. JELIA 1996. Lecture Notes in Computer Science, vol 1126. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61630-6_10

Download citation

  • DOI: https://doi.org/10.1007/3-540-61630-6_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61630-6

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics