Lattice implication ordered semigroups
Information Sciences: an International Journal
Six-Element Linguistic Truth-Valued Intuitionistic Reasoning in Decision Making
ISNN '08 Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks
A linguistic truth-valued reasoning approach in decision making with incomparable information
Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology - Fuzzy theory and technology with applications
A uniform approach of linguistic truth values in sensor evaluation
Fuzzy Optimization and Decision Making
Information Sciences: an International Journal
Implication operator of linguistic truth-valued intuitionistic fuzzy lattice
RSKT'10 Proceedings of the 5th international conference on Rough set and knowledge technology
Determination of α-resolution in lattice-valued first-order logic LF(X)
Information Sciences: an International Journal
α-Lock resolution method for a lattice-valued first-order logic
Engineering Applications of Artificial Intelligence
On compactness and consistency in finite lattice-valued propositional logic
HAIS'10 Proceedings of the 5th international conference on Hybrid Artificial Intelligence Systems - Volume Part II
Ordering based decision making - A survey
Information Fusion
On an algebra of linguistic truth-valued intuitionistic lattice-valued logic
Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology - Recent Advances in Soft Computing: Theories and Applications
Hi-index | 0.00 |
The consistency of a rule base is an essential issue for rule-based intelligent information processing. Due to the uncertainty inevitably included in the rule base, it is necessary to verify the consistency of the rule base while investigating, designing, and applying a rule-based intelligent system. In the framework of the lattice-valued first-order logic system LF(X), which attempts to handle fuzziness and incomparability, this article focuses on how to verify and increase the consistency degree of the rule base in the intelligent information processing system. First, the representations of eight kinds of rule bases in LF(X) as the generalized clause set forms based on these rule bases' nonredundant generalized Skolem standard forms are presented. Then an &agr;-automated reasoning algorithm in LF(X), also used as an automated simplification algorithm, is proposed. Furthermore, the &agr;-consistency and the &agr;-simplification theories of the rule base in LF(X) are formulated, and especially the coherence between these two theories is proved. Therefore, the verification of the &agr;-consistency of the rule base, often an infinity problem that is difficult to solve, can be transformed into a finite and achievable &agr;-simplification problem. Finally, an &agr;-simplification stepwise search algorithm for verifying the consistency of the rule base as well as a kind of filtering algorithm for increasing the consistency level of the rule base are proposed. © 2006 Wiley Periodicals, Inc. Int J Int Syst 21: 399–424, 2006.