Skip to main content
SpringerLink
Log in

From Here to There: Stable Negation in Logic Programming

  • Chapter
What is Negation?

Part of the book series: Applied Logic Series ((APLS,volume 13))

Abstract

The paper examines the logical and conceptual foundations of some standard approaches to the interpretation of negation in systems of extended logic programming. Taking one of the most prominent interpretations of logic programs, the stable model semantics and its generalisations, we show how it conforms to a very simple fixpoint condition, called negation-stability, with respect to the least constructive extension, N2, of the intermediate logic of here-and-there.

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 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.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.

Similar content being viewed by others

References

  1. K. R. Apt and R. Bol. Logic Programming and Negation: A Survey, Journal of Logic Programming, 19, 9 – 71, 1994.

    Article  Google Scholar 

  2. S. Akama. Constructive Predicate Logic with Strong Negation and Model Theory. Notre Dame Journal of Formal Logic, 29, 18 – 27, 1988.

    Article  Google Scholar 

  3. S. Akama. On the Proof Method for Constructive Falsity, Zeitschr f math. Logik und Grundlagen d. Math., 34, 385 – 392, 1988.

    Article  Google Scholar 

  4. A. Almukdad and D. Nelson. Constructible Falsity and Inexact Predicates. Journal of Symbolic Logic, 49, 231 – 233, 1984.

    Article  Google Scholar 

  5. A. Chagrov and M. Zakharyaschev. Modal Companions of Intermediate Propositional Logics. Stu-dia Logica, 51, 49 – 82, 1992.

    Article  Google Scholar 

  6. J. Chen. Minimal Knowledge + Negation as Failure = Only Knowing (Sometimes), in [35], pp. 132–150, 1993.

    Google Scholar 

  7. K. L. Clark. Negation as Failure. In Logic and Databases, H. Gaillaire and J. Minker,eds. pp. 293–322. Plenum Press, 1978.

    Google Scholar 

  8. D. van Dalen. Intuitionistic logic, In Handbook of Philosophical Logic, Vol. III, D. Gabbay and F. Guenthner, eds. Kluwer, Dordrecht, 1986.

    Google Scholar 

  9. J. Dietrich and H. Herre. Outline of Nonmonotonic Model Theory, NTZ Report, Universität Leipzig, 1994.

    Google Scholar 

  10. K. Dolen. The First Axiomatization of a Relevant Logic, Report 9–90, Zentrum f Phil. u. Wissenschaftstheorie Universität Konstanz, 1990.

    Google Scholar 

  11. D. M. Gabbay. Modal provability foundations for negation by failure. In Extensions of Logic Programming, LNAI 475, P. Schroeder-Heister, ed. Springer-Verlag, 1991.

    Google Scholar 

  12. A. van Gelder, K. Ross and J. Schlipf. The well-founded semantics for general logic programs. Journal of the ACM, 38, 620 – 650, 1991.

    Article  Google Scholar 

  13. M. Gelfond. On stratified auto-epistemic theories. In Proceedings ofAAAJ-87. pp. 207–211. Morgan Kaufmann, 1987,

    Google Scholar 

  14. M. Gelfond. Logic programming and reasoning with incomplete information. Annals of Mathematics and Artificial Intelligence, 12, 89 – 116, 1994.

    Article  Google Scholar 

  15. M. Gelfond and V. Lifschitz. The stable model semantics for logic programs. In Proceedings of the 5th International Conference on Logic Programming 2, K. Bowen and R. A. Kowalski, eds. pp. 1070–1080. MIT Press, 1988.

    Google Scholar 

  16. M. Gelfond and V. Lifschitz. Logic programs with classical negation. In Proceedings of ICLP-90, D. Warren and P. Szeredi, eds. pp. 579–597. MIT Press, 1990.

    Google Scholar 

  17. M. Gelfond and V. Lifschtz. Classical negation in logic programs and disjunctive databases. New Generation Computing, 365 – 387, 1991.

    Google Scholar 

  18. K. Gödel. Zum intuitionistischen Aussagenkalkül, Anzeiger der Akademie der Wissenschaften in Wien 69 pp. 65–66; reprinted in [20].

    Google Scholar 

  19. K. Gödel. Eine Interpretation des intuitionistischen Aussagenkalküls, Ergebnisse eines mathematischen Kolloquiums, 4, 39–40, 1933. Reprinted in [20].

    Google Scholar 

  20. K. Gödel. Collected Works, Volume 1, edited by S. Feferman et al., Oxford University Press, 1986.

    Google Scholar 

  21. A. van Gelder, K. Ross and J. Schlipf. The well-founded semantics for general logic programs. Journal of the ACM, 38, 620 – 650, 1991.

    Article  Google Scholar 

  22. Y. Gurevich. Intuitionistic logic with strong negation. Studia Logica, 36, 49 - 59, 1977.

    Article  Google Scholar 

  23. A. Heyting. Die formalen Regeln der intuitionistischen Logik, Sitz. Berlin pp. 42 – 56. 1930.

    Google Scholar 

  24. J. Jaspers. Calculi for Constructive Communication, ILLC Dissertation Series 1994–4, Amsterdam, 1994.

    Google Scholar 

  25. M. Kracht. On Extensions of Intermediate Logics by Strong Negation, FU Berlin, 1995.

    Google Scholar 

  26. V. Lifschitz and G. Schwarz. Extended logic programs as autoepistemic theories. In [35], pp. 101–114, 1993.

    Google Scholar 

  27. J. Lukasiewicz. Die Logik und das Grundlagenproblem, in Les Entretiens de Zurich sur les Fondaments et la Methode des Sciences Mathematiques 1938, Zurich, 1941.

    Google Scholar 

  28. V. Marek and M. Truszczynski. Reflexive autoepistemic logic and logic programming. In [35], pp. 115 – 131, 1993.

    Google Scholar 

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

    Article  Google Scholar 

  30. I. E. Orlov. The calculus of compatibility of propositions (in Russian). Mathematical Sbornik, 35, 263 – 286, 1928.

    Google Scholar 

  31. D. Pearce. Answer set inference and nonmonotonic S4. In Extensions of Logic Programming LNAI 798, R. Dykhoff, ed. Springer, 1994.

    Google Scholar 

  32. D. Pearce. Nonmonotonicity and answer set inference. In Logic Programming and Nonmonotonic Reasoning. Proceedings LPNMR 95 LNAI 928, V. W. Marek, A. Nerode and M. Truszczyiiski, eds. Springer, 1995.

    Google Scholar 

  33. D. Pearce. A new logical characterisation of stable models. In Non-monotonic Extensions of Logic Programming. Proceedings. Fachberichte Informatik, Universität Koblenz 17/96, J. Dix, L. M. Pereira and T. Przymusinski, eds. 1996.

    Google Scholar 

  34. L. M. Pereira and J. J. Alferes. Well founded semantics for logic programs with explicit negation. In Proc ECAI 92, B. Neumann, ed. pp. 102–106. John Wiley, 1992,

    Google Scholar 

  35. L. M. Pereira and A. Nerode, eds. Logic Programming and Non-monotonic Reasoning, MIT Press, 1993.

    Google Scholar 

  36. T. Przymusinski. Stationary semantics for normal and disjunctive logic programs. In Proc DOOD’91, LNCS 566, C. Delobel, M. Kifer and Y. Masunaga, eds. Springer-Verlag, 1991.

    Google Scholar 

  37. W. Rautenberg. Klassische and Nichtklassische Aussagenlogik, Vieweg, Wiesbaden, 1979.

    Book  Google Scholar 

  38. R. M. Solovay. Provability interpretations of modal logic. Israel Journal of Mathematics, 25, 287–304, 1976.

    Google Scholar 

  39. R. Stalnaker. A Note on Non-Monotonic Modal Logic, Manuscript, Cornell University, 1980; reprinted in Artificial Intelligence, 64, 183 – 196, 1993.

    Article  Google Scholar 

  40. R. H. Thomason. A semantical study of constructible falsity. Zeit. f math. Logik and Grundlagen der Mathematik, 15, 247 – 257, 1969.

    Article  Google Scholar 

  41. N. N. Vorob’ev. A constructive propositional calculus with strong negation (in Russian). Doklady Akademii Nauk SSR, 85, 465 – 468, 1952.

    Google Scholar 

  42. N. N. Vorob’ev. The problem of deducibility in constructive propositional calculus with strong negation (in Russian). Doklady Akademii Nauk SSR, 85, 689 – 692, 1952.

    Google Scholar 

  43. R. W6jcicki. Theory of Logical Calculi, Kluwer, Dordrecht, 1988.

    Book  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. German Research Centre for Artificial Intelligence, Saarbrücken, Germany

    David Pearce

Authors
  1. David Pearce
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. King’s College, London, UK

    Dov M. Gabbay

  2. University of Leipzig, Leipzig, Germany

    Heinrich Wansing

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Pearce, D. (1999). From Here to There: Stable Negation in Logic Programming. In: Gabbay, D.M., Wansing, H. (eds) What is Negation?. Applied Logic Series, vol 13. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-9309-0_8

Download citation

  • DOI: https://doi.org/10.1007/978-94-015-9309-0_8

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-90-481-5169-1

  • Online ISBN: 978-94-015-9309-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation