DocumentCode :
2296489
Title :
Three-valued constructive logic and logic programs
Author :
Akama, Seiki
Author_Institution :
Dept. of Inf. Syst., Teikyo Heisei Univ., Chiba, Japan
fYear :
1995
fDate :
23-25 May 1995
Firstpage :
276
Lastpage :
281
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)
Keywords :
computational complexity; logic programming; ternary logic; N completion; N completion semantics; intuitive semantics; logic programs; model theory; negation as failure; semantics; strong negation; strong negation 3N; three valued constructive logic; three-valued constructive logic; Databases; Information systems; Joining processes; Laboratories; Logic programming;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Multiple-Valued Logic, 1995. Proceedings., 25th International Symposium on
Conference_Location :
Bloomington, IN
ISSN :
0195-623X
Print_ISBN :
0-8186-7118-1
Type :
conf
DOI :
10.1109/ISMVL.1995.513543
Filename :
513543
Link To Document :
بازگشت