Satisfiability Problem of Linguistic Truth-Valued Intuitionistic Propositional Logic

Author

Zou, Li ; Li, Wenjiang

Author_Institution

Sch. of Comput. & Inf. Technol., Liaoning Normal Univ., Dalian

fYear

2008

fDate

18-20 June 2008

Firstpage

301

Lastpage

301

Abstract

Truth degree and falsity degree of intuitionistic fuzzy proposition are two truth values with linguistic hedge. In this paper, we constructed linguistic truth-valued intuitionistic propositional logic (LTV-IP) based on linguistic truth-valued lattice implication algebra (LIA) which can express both the comparable and incomparable truth values. Some logic properties regarding reasoning are then obtained. Especially, the implication operation of LTV-IP can be deduced from four times implication of their truth values. Finally, we discussed the satisfiable problem of LTV-IP and proposed resolution principle of LTV-IP.

Keywords

algebra; computability; computational linguistics; fuzzy set theory; intuitionistic fuzzy proposition; lattice implication algebra; linguistic truth-valued intuitionistic propositional logic; satisfiability problem; Algebra; Automation; Educational institutions; Fuzzy logic; Fuzzy sets; Information technology; Lattices; Logic functions; Natural languages; Uncertainty;

fLanguage

English

Publisher

ieee

Conference_Titel

Innovative Computing Information and Control, 2008. ICICIC '08. 3rd International Conference on

Conference_Location

Dalian, Liaoning

Print_ISBN

978-0-7695-3161-8

Electronic_ISBN

978-0-7695-3161-8

Type

conf

DOI

10.1109/ICICIC.2008.485

Filename

4603490