Three-Valued Constructive Logic and Logic Programs

Authors:
Affiliations:
Venue:
ISMVL '95 Proceedings of the 25th International Symposium on Multiple-Valued Logic
Year:
1995

Citing 5
Cited 0

Negation in logic programming

Journal of Logic Programming
Foundations of logic programming; (2nd extended ed.)

Foundations of logic programming; (2nd extended ed.)
Negation in logic programming

Foundations of deductive databases and logic programming
Signed data dependencies in logic programs

Journal of Logic Programming
Logic programming with strong negation

Proceedings of the international workshop on Extensions of logic programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Abstract: We propose three valued constructive logic with strong negation 3N by describing both proof and model theory. We relate the proposed three valued system to J. Lukasiewicz's (1920) three valued logic. We demonstrate that 3N is very useful to formalize a semantics for logic programs with negation as failure within the framework of constructive logic. We introduce the concept of N completion to provide an intuitive semantics in which negation as failure can be interpreted as strong negation. The N completion semantics is a natural alternative to K. Kunen's three valued completion semantics (1987; 1989).