Lindenbaum-algebraic semantics of logic programs
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.
Unable to display preview. Download preview PDF.
- A. Almukdad and D. Nelson: Constructible Falsity and Inexact Predicates, JSL 49/1 (1984), 231–233Google Scholar
- [1a][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
- [1b][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
- D. Miller: A Logical Analysis of Modules in Logic Programming, JLP 1989, 79–108Google Scholar
- D. Nelson: Constructible Falsity, JSL 14 (1949), 16–26Google Scholar
- 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, 1989Google Scholar
- [4a][Przymusinksi 1990]T.C. Przymusinski: Well-founded Semantics Coincides with Three-Valued Stable Semantics, Fundamenta Informaticae XIII (1990), 445–463Google Scholar
- H. Rasiowa, An Algebraic Approach to Non-classical Logics, North-Holland, 1974Google Scholar