Determination of α-resolution in lattice-valued first-order logic LF(X)

Research output: Contribution to journalArticle

Standard

Determination of α-resolution in lattice-valued first-order logic LF(X). / Xu, Yang; Liu, Jun; Ruan, Da; Li, Xiaobing.

In: Information Sciences, Vol. 181, No. 10, 15.05.2011, p. 1836-1862.

Research output: Contribution to journalArticle

Harvard

Xu, Y, Liu, J, Ruan, D & Li, X 2011, 'Determination of α-resolution in lattice-valued first-order logic LF(X)', Information Sciences, vol. 181, no. 10, pp. 1836-1862. https://doi.org/10.1016/j.ins.2010.03.024

APA

Vancouver

Author

Xu, Yang ; Liu, Jun ; Ruan, Da ; Li, Xiaobing. / Determination of α-resolution in lattice-valued first-order logic LF(X). In: Information Sciences. 2011 ; Vol. 181, No. 10. pp. 1836-1862.

Bibtex - Download

@article{0d3d7dbb186f4b719041ecc858cf3769,
title = "Determination of α-resolution in lattice-valued first-order logic LF(X)",
abstract = "Key issues for resolution-based automated reasoning in lattice-valued first-order logic LF(X) are investigated with truth-values in a lattice-valued logical algebraic structure–lattice implication algebra (LIA). The determination of resolution at a certain truth-value level (called α-resolution) in LF(X) is proved to be equivalently transformed into the determination of α-resolution in lattice-valued propositional logic LP(X) based on LIA. The determination of α-resolution of any quasi-regular generalized literals and constants under various cases in LP(X) is further analyzed, specified, and subsequently verified. Hence the determination of α-resolution in LF(X) can be accordingly solved to a very broad extent, which not only lays a foundation for the practical implementation of automated reasoning algorithms in LF(X), but also provides a key support for α-resolution-based automated reasoning approaches and algorithms in LIA based linguistic truth-valued logics.",
keywords = "Incomparability, Many-valued logic, Automated reasoning, Lattice implication algebra, Lattice-valued logic, α-Resolution",
author = "Yang Xu and Jun Liu and Da Ruan and Xiaobing Li",
note = "Score=10",
year = "2011",
month = "5",
day = "15",
doi = "10.1016/j.ins.2010.03.024",
language = "English",
volume = "181",
pages = "1836--1862",
journal = "Information Sciences",
issn = "0020-0255",
publisher = "Elsevier",
number = "10",

}

RIS - Download

TY - JOUR

T1 - Determination of α-resolution in lattice-valued first-order logic LF(X)

AU - Xu, Yang

AU - Liu, Jun

AU - Ruan, Da

AU - Li, Xiaobing

N1 - Score=10

PY - 2011/5/15

Y1 - 2011/5/15

N2 - Key issues for resolution-based automated reasoning in lattice-valued first-order logic LF(X) are investigated with truth-values in a lattice-valued logical algebraic structure–lattice implication algebra (LIA). The determination of resolution at a certain truth-value level (called α-resolution) in LF(X) is proved to be equivalently transformed into the determination of α-resolution in lattice-valued propositional logic LP(X) based on LIA. The determination of α-resolution of any quasi-regular generalized literals and constants under various cases in LP(X) is further analyzed, specified, and subsequently verified. Hence the determination of α-resolution in LF(X) can be accordingly solved to a very broad extent, which not only lays a foundation for the practical implementation of automated reasoning algorithms in LF(X), but also provides a key support for α-resolution-based automated reasoning approaches and algorithms in LIA based linguistic truth-valued logics.

AB - Key issues for resolution-based automated reasoning in lattice-valued first-order logic LF(X) are investigated with truth-values in a lattice-valued logical algebraic structure–lattice implication algebra (LIA). The determination of resolution at a certain truth-value level (called α-resolution) in LF(X) is proved to be equivalently transformed into the determination of α-resolution in lattice-valued propositional logic LP(X) based on LIA. The determination of α-resolution of any quasi-regular generalized literals and constants under various cases in LP(X) is further analyzed, specified, and subsequently verified. Hence the determination of α-resolution in LF(X) can be accordingly solved to a very broad extent, which not only lays a foundation for the practical implementation of automated reasoning algorithms in LF(X), but also provides a key support for α-resolution-based automated reasoning approaches and algorithms in LIA based linguistic truth-valued logics.

KW - Incomparability

KW - Many-valued logic

KW - Automated reasoning

KW - Lattice implication algebra

KW - Lattice-valued logic

KW - α-Resolution

UR - https://ecm.sckcen.be/OTCS/llisapi.dll/overview/39155443

U2 - 10.1016/j.ins.2010.03.024

DO - 10.1016/j.ins.2010.03.024

M3 - Article

VL - 181

SP - 1836

EP - 1862

JO - Information Sciences

JF - Information Sciences

SN - 0020-0255

IS - 10

ER -

ID: 6856416