On the Consistency of Rule-Bases Based on Lattice-Valued First-Order Logic LF(X)

Research output: Contribution to journalArticle

Standard

On the Consistency of Rule-Bases Based on Lattice-Valued First-Order Logic LF(X). / Xu, Yang; Liu, Jun; Ruan, Da; Lee, Tsu-Tian; Maes, Dirk (Peer reviewer).

In: International Journal of Intelligent Systems, Vol. 21, No. 4, 04.2006, p. 399-424.

Research output: Contribution to journalArticle

Harvard

Xu, Y, Liu, J, Ruan, D, Lee, T-T & Maes, D 2006, 'On the Consistency of Rule-Bases Based on Lattice-Valued First-Order Logic LF(X)', International Journal of Intelligent Systems, vol. 21, no. 4, pp. 399-424. https://doi.org/10.1002/int.20129

APA

Xu, Y., Liu, J., Ruan, D., Lee, T-T., & Maes, D. (2006). On the Consistency of Rule-Bases Based on Lattice-Valued First-Order Logic LF(X). International Journal of Intelligent Systems, 21(4), 399-424. https://doi.org/10.1002/int.20129

Vancouver

Xu Y, Liu J, Ruan D, Lee T-T, Maes D. On the Consistency of Rule-Bases Based on Lattice-Valued First-Order Logic LF(X). International Journal of Intelligent Systems. 2006 Apr;21(4):399-424. https://doi.org/10.1002/int.20129

Author

Xu, Yang ; Liu, Jun ; Ruan, Da ; Lee, Tsu-Tian ; Maes, Dirk. / On the Consistency of Rule-Bases Based on Lattice-Valued First-Order Logic LF(X). In: International Journal of Intelligent Systems. 2006 ; Vol. 21, No. 4. pp. 399-424.

Bibtex - Download

@article{df6434ba8e5548b482b2723d23f32a2e,
title = "On the Consistency of Rule-Bases Based on Lattice-Valued First-Order Logic LF(X)",
abstract = "The consistency of a rule-base is an essential issue for the rule-based intelligent information processing. In the framework of the lattice-valued first-order logic system LF(X) which is in the attempt of handling fuzziness and incomparability, this paper focuses on how to verify and increase the consistency degree of the rule-base in the intelligent information process system. Firstly, the representations of eight kinds of the rule-bases in LF(X) as the generalized clause set forms based on these rule-bases’ non-redundant generalized Skolem standard forms are presented. Then an -automated reasoning algorithm in LF(X), also used as an automated simplification algorithm, is proposed. Furthermore, the -consistency and the -simplification theories of the rule-base in LF(X) are formulated, especially the coherence between these two theories is proved. Therefore, the verification of the -consistency of the rule-base, often an infinity problem which is difficult to be achieved, can be transformed into a finite and achievable -simplification problem. Finally, an -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.",
keywords = "Rule-base, consistency, uncertainty, lattice-valued first-order logic, automated reasoning",
author = "Yang Xu and Jun Liu and Da Ruan and Tsu-Tian Lee and Dirk Maes",
note = "Score = 10",
year = "2006",
month = "4",
doi = "10.1002/int.20129",
language = "English",
volume = "21",
pages = "399--424",
journal = "International Journal of Intelligent Systems",
issn = "0884-8173",
publisher = "Wiley - John Wiley & Sons, Ltd",
number = "4",

}

RIS - Download

TY - JOUR

T1 - On the Consistency of Rule-Bases Based on Lattice-Valued First-Order Logic LF(X)

AU - Xu, Yang

AU - Liu, Jun

AU - Ruan, Da

AU - Lee, Tsu-Tian

A2 - Maes, Dirk

N1 - Score = 10

PY - 2006/4

Y1 - 2006/4

N2 - The consistency of a rule-base is an essential issue for the rule-based intelligent information processing. In the framework of the lattice-valued first-order logic system LF(X) which is in the attempt of handling fuzziness and incomparability, this paper focuses on how to verify and increase the consistency degree of the rule-base in the intelligent information process system. Firstly, the representations of eight kinds of the rule-bases in LF(X) as the generalized clause set forms based on these rule-bases’ non-redundant generalized Skolem standard forms are presented. Then an -automated reasoning algorithm in LF(X), also used as an automated simplification algorithm, is proposed. Furthermore, the -consistency and the -simplification theories of the rule-base in LF(X) are formulated, especially the coherence between these two theories is proved. Therefore, the verification of the -consistency of the rule-base, often an infinity problem which is difficult to be achieved, can be transformed into a finite and achievable -simplification problem. Finally, an -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.

AB - The consistency of a rule-base is an essential issue for the rule-based intelligent information processing. In the framework of the lattice-valued first-order logic system LF(X) which is in the attempt of handling fuzziness and incomparability, this paper focuses on how to verify and increase the consistency degree of the rule-base in the intelligent information process system. Firstly, the representations of eight kinds of the rule-bases in LF(X) as the generalized clause set forms based on these rule-bases’ non-redundant generalized Skolem standard forms are presented. Then an -automated reasoning algorithm in LF(X), also used as an automated simplification algorithm, is proposed. Furthermore, the -consistency and the -simplification theories of the rule-base in LF(X) are formulated, especially the coherence between these two theories is proved. Therefore, the verification of the -consistency of the rule-base, often an infinity problem which is difficult to be achieved, can be transformed into a finite and achievable -simplification problem. Finally, an -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.

KW - Rule-base

KW - consistency

KW - uncertainty

KW - lattice-valued first-order logic

KW - automated reasoning

UR - http://ecm.sckcen.be/OTCS/llisapi.dll/open/ezp_33053

UR - http://knowledgecentre.sckcen.be/so2/bibref/3683

U2 - 10.1002/int.20129

DO - 10.1002/int.20129

M3 - Article

VL - 21

SP - 399

EP - 424

JO - International Journal of Intelligent Systems

JF - International Journal of Intelligent Systems

SN - 0884-8173

IS - 4

ER -

ID: 120386