DocumentCode
1956376
Title
Algorithm of transforming any formula in LP(X) to a pure-generalized conjunction normal form
Author
Meng, Dan ; Xu, Yang ; Qin, Keyun
Author_Institution
Dept. of Appl. Math., Southwest Jiaotong Univ., Sichuan, China
fYear
2002
fDate
2002
Firstpage
40
Lastpage
45
Abstract
In the present paper the algorithm of transforming any formula in LP(X) to a pure-generalized conjunction normal form is focused. Concretely, some important concepts and results about lattice implication algebra (LIA), lattice-valued prepositional logic LP(X) and resolution principle based on LP(X) are introduced firstly. Then algorithm of transforming any implication term to a reducible form is considered. Finally, the method of transforming any formula F in LP(X) to a pure-generalized conjunction normal form is given.
Keywords
algebra; formal logic; inference mechanisms; LP(X) formula transformation; lattice implication algebra; lattice-valued prepositional logic; pure-generalized conjunction normal form; resolution principle; Algebra; Artificial intelligence; Databases; Fuzzy logic; Lattices; Logic functions; Logic programming; Mathematics; Multivalued logic; Problem-solving;
fLanguage
English
Publisher
ieee
Conference_Titel
Fuzzy Information Processing Society, 2002. Proceedings. NAFIPS. 2002 Annual Meeting of the North American
Print_ISBN
0-7803-7461-4
Type
conf
DOI
10.1109/NAFIPS.2002.1018027
Filename
1018027
Link To Document