Skip to main content
SpringerLink
Log in

Lindenbaum-algebraic semantics of logic programs

  • Conference paper
  • First Online:
Nonclassical Logics and Information Processing (All-Berlin 1990)

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

Included in the following conference series:

  • 121 Accesses

Abstract

We show how to obtain the Lindenbaum algebra of a logic program. In the case of a positive program it is simply a distributive lattice with a greatest element. We also investigate programs with strong negation which allow to represent and process explicit negative information. Although we have double negation elimination and the DeMorgan rules we do not obtain a DeMorgan algebra as the Lindenbaum algebra of a program with strong negation as one could have expected.

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. A. Almukdad and D. Nelson: Constructible Falsity and Inexact Predicates, JSL 49/1 (1984), 231–233

    Google Scholar 

  2. [Gelfond & Lifschitz 1990] M. Gelfond and V. Lifschitz: Logic Programs with Classical Negation, in D. Warren and P. Szeredi (eds.), Logic Programming: Proc. Int. Conf. and Symp. 1990

    Google Scholar 

  3. [Kowalski & Sadri 1990] R. Kowalski and F. Sadri: Logic Programs with Exceptions, in D. Warren and P. Szeredi (eds.), Logic Programming: Proc. Int. Conf. and Symp. 1990

    Google Scholar 

  4. D. Miller: A Logical Analysis of Modules in Logic Programming, JLP 1989, 79–108

    Google Scholar 

  5. D. Nelson: Constructible Falsity, JSL 14 (1949), 16–26

    Google Scholar 

  6. D. Pearce and G. Wagner, Reasoning with Negative Information I-Strong Negation in Logic Programs, Bericht der Gruppe fr Logik, Wissenstheorie und Information, Freie Universitt Berlin, 1989

    Google Scholar 

  7. [Przymusinksi 1990]T.C. Przymusinski: Well-founded Semantics Coincides with Three-Valued Stable Semantics, Fundamenta Informaticae XIII (1990), 445–463

    Google Scholar 

  8. H. Rasiowa, An Algebraic Approach to Non-classical Logics, North-Holland, 1974

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Gruppe Logik, Wissenstheorie und Information, Freie Universität Berlin, Deutschland

    Gerd Wagner

Authors
  1. Gerd Wagner
    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

Wagner, G. (1992). Lindenbaum-algebraic semantics of 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/BFb0031925

Download citation

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

  • 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