A Kind of Resolution Method of Linguistic Truth-Valued Propositional Logic Based on LIA

Author

Zou, Li ; Li, Jinglong ; Xu, Kaijun ; Xu, Yang

Author_Institution

Liaoning Normal Univ., Dalian

Volume

1

fYear

2007

fDate

24-27 Aug. 2007

Firstpage

32

Lastpage

36

Abstract

In the present paper, based on lattice implication algebra, a kind of linguistic truth-valued propositional logic is constructed with some logic properties regarding reasoning being provided which can express both the comparable and incomparable truth values. Secondly, the satisfiability problem is discussed. J-true, J-false of a formula, J-similar literals and J-complementary literals are proposed based on a filter J of L. Finally, Based on the degree of complementary and degree of similar J-resolution method in the filter of the linguistic truth-valued propositional logic is introduced.

Keywords

computability; computational linguistics; inference mechanisms; natural language processing; J-complementary literals; J-false; J-resolution method; J-similar literals; J-true; lattice implication algebra; linguistic truth-valued propositional logic; reasoning; satisfiability problem; Algebra; Educational institutions; Filters; Humans; Information technology; Intelligent control; Lattices; Logic functions; Natural languages; Uncertainty;

fLanguage

English

Publisher

ieee

Conference_Titel

Fuzzy Systems and Knowledge Discovery, 2007. FSKD 2007. Fourth International Conference on

Conference_Location

Haikou

Print_ISBN

978-0-7695-2874-8

Type

conf

DOI

10.1109/FSKD.2007.52

Filename

4405883