DocumentCode :
2296018
Title :
Paraconsistent circumscription: first-order case
Author :
Lin, Zuoquan
Author_Institution :
Comput. Sci. Dept., Shantou Univ., Guangdong, China
fYear :
1995
fDate :
23-25 May 1995
Firstpage :
112
Lastpage :
116
Abstract :
In this paper we describe paraconsistent circumscription by application of predicate circumscription in a paraconsistent logic. In addition to circumscribe the predicates, we also circumscribe the inconsistency. Paraconsistent circumscription can be well characterized by the minimal semantics that is both nonmonotonic and paraconsistent. It brings us advantages at least in two respects: nonmonotonic logic would be nontrivial while there was a contradiction, and paraconsistent logic would be equivalent to classical logic while there was no direct effect of a contradiction
Keywords :
formal logic; nonmonotonic reasoning; classical logic; minimal semantics; nonmonotonic logic; paraconsistent circumscription; paraconsistent logic; predicate circumscription; Application software; Computer aided software engineering; Computer science; Logic;
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.513518
Filename :
513518
Link To Document :
بازگشت