Skip to main content
SpringerLink
Log in
Book cover

Workshop on Nonclassical Logics and Information Processing

All-Berlin 1990: Nonclassical Logics and Information Processing pp 63–79Cite as

Reasoning with negative information, II: Hard negation, strong negation and logic programs

  • Conference paper
  • First Online:

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

Abstract

In the framework of extended logic programming we propose a criterion by which a negation operator can be said to express explicit falsity. We show that a certain system of constructive logic with strong negation, due to López-Escobar (1972) and Almukdad & Nelson (1984), fulfils this criterion, as do several recent systems of logic programming, including that of Gelfond & Lifschitz (1990). We use these facts to infer that, from a logical point of view, the programming systems in question can be viewed as subsystems of constructive logic.

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

  • Akama, S, On the Proof Method for Constructive Falsity, Zeit. math. Logik & Grundlagen d. Math. 34 (1988), 385–392.

    Google Scholar 

  • Almukdad, D & Nelson, D, Constructible Falsity and Inexact Predicates, J Symbolic Logic 49 (1984), 231–233.

    Google Scholar 

  • Cellucci, C., Using Full First-Order Logic as a Programming Language, in Proc. Logic and Computer Sciences 1986, Rend. Sem. Mat. Univ. Pol. Torino, 1987.

    Google Scholar 

  • Fitting, M, A Kripke-Kleene Semantics for Logic Programs, J Logic Programming 3 (1986), 75–88.

    Google Scholar 

  • Gabbay, D & Sergot, M, Negation as Inconsistency, J Logic Programming 3 (1986), 1–35.

    Google Scholar 

  • Gelfond, M & Lifschitz, V, The Stable Model Semantics for Logic Programming, in Kowalski, R & Bowen, K, (Eds), Proc. ICLP-88, MIT Press, 1988, 1070–1080.

    Google Scholar 

  • Gelfond, M & Lifschitz, V, Logic Programs with Classical Negation, in Warren, D & Szeredi, P, (Eds), Proc. ICLP-90, MIT Press, 1990, 579–597.

    Google Scholar 

  • Gurevich, Y, Intuitionistic Logic with Strong Negation, Studia Logica 36 (1977), 49–59.

    Google Scholar 

  • Hallnäs, L & Schroeder-Heister, P, A Proof-Theoretic Approach to Logic Programming, J Logic and Computation 1(1990).

    Google Scholar 

  • Kowalski, R & Sadri, F, Logic Programs with Exceptions, in Warren, D & Szeredi, P, (Eds.), Proc. ICLP-90, MIT Press, 1990.

    Google Scholar 

  • Kutschera, F, Ein verallgemeinerter Widerlegungsbegriff für Gentzenkalküle, Arch. Math. Logik 12 (1969), 104–118.

    Google Scholar 

  • Levesque, H, Making Believers out of Computers, Artificial Intelligence 30 (1986), 81–107.

    Google Scholar 

  • López-Escobar, E G K, Refutability and Elementary Number Theory, Indag. Math. 34 (1972), 362–374.

    Google Scholar 

  • Lu, J & Subrahmanian, V, Protected Completions of First-Order General Logic Programs, J Automated Reasoning 6 (1990), 147–172.

    Google Scholar 

  • Miller, D, A Logical Analysis of Modules in Logic Programming, J Logic Programming 6 (1989), 79–108.

    Google Scholar 

  • Nelson, D, Constructible Falsity, J Symbolic Logic 14 (1949), 16–26.

    Google Scholar 

  • Nelson, D, Negation and Separation of Concepts in Constructive Systems, in Heyting, A (Ed), Constructivity in Mathematics, North-Holland, Amsterdam, 1959.

    Google Scholar 

  • Pearce, D & Wagner, G, Reasoning with Negative Information, I: Strong Negation in Logic Programs, in Haaparanta, L, Kusch, M, & Niiniluoto, I, (eds.), Language, Knowledge, and Intentionality, (Acta Philosophica Fennica 49), Helsinki, 1990, 430–453.

    Google Scholar 

  • Pearce, D & Wagner, G, Logic Programming with Strong Negation, in Schroeder-Heister, P, (Ed), Extensions of Logic Programming, Lecture Notes in AI, Vol. 475, Springer-Verlag, Berlin etc, 1991, 311–326.

    Google Scholar 

  • Poole, D & Goebel, R, Gracefully Adding Negation and Disjunction to Prolog, Proc. ICLP-86, MIT Press, 1986.

    Google Scholar 

  • Przymusinski, T, Perfect Model Semantics, in Kowalski, R, & Bowen, K, (Eds.), Proc. ICLP-88, MIT Press, 1988.

    Google Scholar 

  • Reiter, R, A Logic for Default Reasoning, Artificial Intelligence 13 (1980), 81–132.

    Google Scholar 

  • Sergot, M, Sadri, F, Kowalski, R, Kriwaczek, F, Hammond, P & Cory, H T, The British Nationality Act as a Logic Program, Communications of the ACM 29 (1986), 370–386.

    Google Scholar 

  • Tan, Y-H, Standard Inference in Partial Logic, Technical Report, Free University Amsterdam, 1989.

    Google Scholar 

  • Wagner, G, Logic Programming with Strong Negation and Inexact Predicates, Journal of Logic and Computation 1:6 (1991).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Gruppe Logik, Wissenstheorie und Information Institut für Philosophie, Freie Universität Berlin, Habelschwerdter Allee 30, D-1000, Berlin 33

    David Pearce

Authors
  1. David Pearce
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

David Pearce Heinrich Wansing

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pearce, D. (1992). Reasoning with negative information, II: Hard negation, strong negation and logic programs. In: Pearce, D., Wansing, H. (eds) Nonclassical Logics and Information Processing. All-Berlin 1990. Lecture Notes in Computer Science, vol 619. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0031924

Download citation

  • DOI: https://doi.org/10.1007/BFb0031924

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-47280-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation