Resolution principle based on finite chain lattice-valued proposition logic FCLP(X)

Author

Meng, Dan ; Qiu, Xiaoping

Author_Institution

Dept. of Appl. Math., Southwest Jiaotong Univ., Sichuan, China

Volume

1

fYear

2003

Firstpage

61

Abstract

In the present paper, resolution-based automated reasoning theory and algorithm in a finite chain lattice-valued proposition logic are focused. Concretely, the resolution principle, which is based on a finite chain lattice-valued propositional logic FCLP(X) is investigated. And soundness theorem and completeness theorem of this resolution principle are also proved. In order to realize resolution, the concrete algorithm of resolution is discussed. It is hoped that this research will make forward theoretical research of automated reasoning based on lattice-valued logic.

Keywords

fuzzy logic; inference mechanisms; multivalued logic; process algebra; completeness theorem; finite chain lattice-valued proposition logic; forward resolution; lattice implication algebra; multivalued logic; resolution principle; resolution-based automated reasoning; soundness theorem; ultrafilter; Computational intelligence; Concrete; Fuzzy logic; Intelligent control; Lattices; Logic functions; Logic programming; Mathematics; Multivalued logic; Telephony;

fLanguage

English

Publisher

ieee

Conference_Titel

Fuzzy Systems, 2003. FUZZ '03. The 12th IEEE International Conference on

Print_ISBN

0-7803-7810-5

Type

conf

DOI

10.1109/FUZZ.2003.1209338

Filename

1209338