DocumentCode
388821
Title
α-automated reasoning method based on regular generalized conjunctive normal form of LP(X)
Author
Wei, Wang ; Baoqing, Jiang ; Yang, Xu
Author_Institution
Dept. of Appl. Math., Southwest Jiaotong Univ., Sichuan, China
Volume
4
fYear
2002
fDate
6-9 Oct. 2002
Abstract
We focus on automated reasoning based on lattice-valued propositional logic LP(X). A new method of automated reasoning is given, and the soundness and completeness theorems of this method are also proved.
Keywords
formal logic; inference mechanisms; theorem proving; LP(X); alpha automated reasoning method; completeness; lattice-valued propositional logic; matrix representation; regular generalized conjunctive normal form; soundness; theorem proving; Algebra; Cost accounting; Lattices; Logic functions; Mathematics;
fLanguage
English
Publisher
ieee
Conference_Titel
Systems, Man and Cybernetics, 2002 IEEE International Conference on
ISSN
1062-922X
Print_ISBN
0-7803-7437-1
Type
conf
DOI
10.1109/ICSMC.2002.1173316
Filename
1173316
Link To Document