Weak completeness of resolution in a linguistic truth-valued propositional logic

Yang Xu; Shuwei Chen; Jun Liu; Da Ruan

doi:10.1007/978-3-540-72434-6_36

Weak completeness of resolution in a linguistic truth-valued propositional logic

Yang Xu, Shuwei Chen, Jun Liu, Da Ruan

Research output › peer-review

Abstract

In the present paper, the weak completeness of α-resolution principle for a lattice-valued logic (L_n ×L₂ P(X) with truth value in a logical algebra (lattice implication algebra L_n × L₂, is established. Accordingly, the weak completeness of (Exactly, True)-resolution principle for a linguistic truth-valued propositional logic l based on the linguistic truth-valued lattice implication algebra L-LIA is derived.

Original language	English
Title of host publication	Theoretical Advances and Applications of Fuzzy Logic and Soft Computing
Editors	Oscar Castillo, Patricia Melin, Oscar Montiel Ross, Roberto Sepulveda Cruz, Witold Pedrycz, Janusz Kacprzyk
Pages	358-366
Number of pages	9
DOIs	https://doi.org/10.1007/978-3-540-72434-6_36
State	Published - 2007

Publication series

Name	Advances in Soft Computing
Volume	42
ISSN (Print)	1615-3871
ISSN (Electronic)	1860-0794

ASJC Scopus subject areas

Computer Science (miscellaneous)
Computational Mechanics
Computer Science Applications

Access to Document

10.1007/978-3-540-72434-6_36License: Unspecified

Cite this

Xu, Y., Chen, S., Liu, J., & Ruan, D. (2007). Weak completeness of resolution in a linguistic truth-valued propositional logic. In O. Castillo, P. Melin, O. M. Ross, R. S. Cruz, W. Pedrycz, & J. Kacprzyk (Eds.), Theoretical Advances and Applications of Fuzzy Logic and Soft Computing (pp. 358-366). (Advances in Soft Computing; Vol. 42). https://doi.org/10.1007/978-3-540-72434-6_36

@inbook{95e21259051f491caf14a9b5bf9c883c,

title = "Weak completeness of resolution in a linguistic truth-valued propositional logic",

abstract = "In the present paper, the weak completeness of α-resolution principle for a lattice-valued logic (Ln ×L2 P(X) with truth value in a logical algebra (lattice implication algebra Ln × L2, is established. Accordingly, the weak completeness of (Exactly, True)-resolution principle for a linguistic truth-valued propositional logic l based on the linguistic truth-valued lattice implication algebra L-LIA is derived.",

author = "Yang Xu and Shuwei Chen and Jun Liu and Da Ruan",

year = "2007",

doi = "10.1007/978-3-540-72434-6_36",

language = "English",

isbn = "9783540724339",

series = "Advances in Soft Computing",

pages = "358--366",

editor = "Oscar Castillo and Patricia Melin and Ross, {Oscar Montiel} and Cruz, {Roberto Sepulveda} and Witold Pedrycz and Janusz Kacprzyk",

booktitle = "Theoretical Advances and Applications of Fuzzy Logic and Soft Computing",

}

Weak completeness of resolution in a linguistic truth-valued propositional logic. / Xu, Yang; Chen, Shuwei; Liu, Jun et al.
Theoretical Advances and Applications of Fuzzy Logic and Soft Computing. ed. / Oscar Castillo; Patricia Melin; Oscar Montiel Ross; Roberto Sepulveda Cruz; Witold Pedrycz; Janusz Kacprzyk. 2007. p. 358-366 (Advances in Soft Computing; Vol. 42).

Research output › peer-review

TY - CHAP

T1 - Weak completeness of resolution in a linguistic truth-valued propositional logic

AU - Xu, Yang

AU - Chen, Shuwei

AU - Liu, Jun

AU - Ruan, Da

PY - 2007

Y1 - 2007

N2 - In the present paper, the weak completeness of α-resolution principle for a lattice-valued logic (Ln ×L2 P(X) with truth value in a logical algebra (lattice implication algebra Ln × L2, is established. Accordingly, the weak completeness of (Exactly, True)-resolution principle for a linguistic truth-valued propositional logic l based on the linguistic truth-valued lattice implication algebra L-LIA is derived.

AB - In the present paper, the weak completeness of α-resolution principle for a lattice-valued logic (Ln ×L2 P(X) with truth value in a logical algebra (lattice implication algebra Ln × L2, is established. Accordingly, the weak completeness of (Exactly, True)-resolution principle for a linguistic truth-valued propositional logic l based on the linguistic truth-valued lattice implication algebra L-LIA is derived.

UR - http://www.scopus.com/inward/record.url?scp=58149217912&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-72434-6_36

DO - 10.1007/978-3-540-72434-6_36

M3 - Chapter

AN - SCOPUS:58149217912

SN - 9783540724339

T3 - Advances in Soft Computing

SP - 358

EP - 366

BT - Theoretical Advances and Applications of Fuzzy Logic and Soft Computing

A2 - Castillo, Oscar

A2 - Melin, Patricia

A2 - Ross, Oscar Montiel

A2 - Cruz, Roberto Sepulveda

A2 - Pedrycz, Witold

A2 - Kacprzyk, Janusz

ER -