文摘
英文文摘
Symbols and Abbreviations
1 Introduction
1.1 Research motivation
1.1.1 General background
1.1.2 Related work
1.1.3 Objectives and problem descriptions
1.2 Contributions
1.3 Organization of the dissertation
2 Preliminaries
2.1 Linguistic truth-valued lattice implication algebras
2.2 Linguistic truth-valued lattice-valued logic
2.3 α-Resolution principle in lattice-valued logic
3 The structure of generalized literals in linguistic truth-valued lattice-valued propositional logic
3.1 Introduction
3.2 The structure of k-IESF in L6P(X)
3.2.1 The structure of 3-IESF in L6P(X)
3.2.2 The structure of 4-IESF in L6P(X)
3.2.3 An algorithm for finding k-IESFs in L6P(X)
3.3 A unified method for finding k-IESFs in Ln×2P(X)
3.4 Normal properties of generalized literals
3.5 Discussions
4 α-Lock resolution method for lattice-valued logic
4.1 Introduction
4.2 α-Lock resolution method in LP(X)
4.3 α-Lock resolution method in LF(X)
4.3.1 α-Lock resolution for LF(X)
4.3.2 The soundness and completeness of α-lock resolution in LF(X)
4.3.3 An algorithm for α-lock resolution for LF(X)
4.4 The transformation of α-lock resolution between Lv(n×z)F(X)and LnP(X)
4.5 α-Satisfiability of formulae
4.5.1 α-Satisfiability of formulae in LnP(X)
4.5.2 A universal algorithm for validating α-resolvability of formulae
4.6 Discussions
5 On compatibilities of α-lock resolution method in linguistic truth-valued lattice-valued logic
5.1 Introduction
5.2 Compatibility with generalized deleting strategy
5.2.1 α-Lock resolution with generalized deleting strategy in LnF(X)
5.2.2 An algorithm for α-lock resolution with generalized deleting strategy
5.3 Compatibility with α-linear resolution method
5.3.1 α-Linear semi-lock resolution method in LnF(X)
5.3.2 An algorithm for α-linear semi-lock resolution in LnP(X)
5.4 Compatibility with α-input resolution method
5.4.1 α-Input(α-Unit)resolution method in LnF(X)
5.4.2 The completeness of α-input(α-unit)resolution in LnF(X)
5.4.3 An algorithm for α-unit resolution method in LnP(X)
5.4.4 α-Lock resolution with α-input resolution method in LnF(X)
5.5 Discussions
6 A general form of α-generalized resolution principle for linguistic truth-valued lattice-valued logic
6.1 Introduction
6.2 α-Generalized resolution principle for Lv(n×2)P(X)
6.3 α-Generalized resolution principle for Lv(n×2)F(X)
6.3.1 The α-unsatisfiblity for a general form of the logical formula
6.3.2 The completeness for the general form of α-generalized resolution principle
6.4 The transformation of α-generalized resolution between Lv(n×2)F(X)and LnP(X)
6.5 Discussions
7 α-Generalized lock resolution method for linguistic truth-valued lattiee-valued logic
7.1 Introduction
7.2 α-Generalized lock resolution method in LP(X)
7.3 α-Generalized lock resolution method in LF(X)
7.4 Equivalent transformation of α-generalized lock resolution
7.5 An algorithm for α-generalized lock resolution LnP(X)
7.6 Discussions
8 On compatibility of α-generalized lock resolution method for linguistic truth-valued lattice-valued logic
8.1 Introduction
8.2 Compatibility with α-generalized linear resolution
8.2.1 α-Generalized linear semi-lock resolution method in LnF(X)
8.2.2 An algorithm for α-generalized linear semi-lock resolution in LnP(X)
8.3 Comparisons with α-generalized resolution methods
8.4 Discussions
Conclusions and further works
Acknowledgements
Bibliography
Appendix Ⅰ
Appendix Ⅱ
List of publications and research projects
西南交通大学;