α-Quasi-lock semantic resolution method for linguistic truth-valued lattice-valued propositional logic ℒ v(n×2)P(X)

Xiaomei Zhong, Jun Liu, Shuwei Chen, Yang Xu

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    2 Citations (Scopus)

    Abstract

    On the basis of α-quasi-lock semantic resolution method in lattice-valued propositional logic (ℒ n×ℒ 2) P(X), α-quasi-lock semantic resolution in linguistic truth-valued lattice-valued propositional logic ℒ v(n×2)P(X) is studied in the present paper. Firstly, (c i , t)-quasi-lock semantic resolution for ℒ v(n×2)P(X) is equivalently transformed into that for lattice-valued propositional logic ℒ vnP(X). Secondly, similar equivalence between (c i , f)-quasi-lock semantic resolution for ℒ v(n×2)P(X) and that for ℒ vnP(X) is also established under certain conditions.

    Original languageEnglish
    Title of host publicationFoundations of Intelligent Systems
    Subtitle of host publicationProceedings of the Sixth International Conference on Intelligent Systems and Knowledge Engineering, Shanghai, China, Dec 2011 (ISKE2011)
    EditorsYinglin Wang, Tianrui Li
    Pages159-169
    Number of pages11
    DOIs
    Publication statusPublished - 2011

    Publication series

    NameAdvances in Intelligent and Soft Computing
    Volume122
    ISSN (Print)1867-5662

    Keywords

    • α-Quasi-lock semantic resolution method
    • Linguistic truth-valued lattice implication algebra
    • Linguistic truth-valued lattice-valued propositional logic
    • Resolution-based automated reasoning

    Fingerprint

    Dive into the research topics of 'α-Quasi-lock semantic resolution method for linguistic truth-valued lattice-valued propositional logic ℒ <sub>v(n×2)</sub>P(X)'. Together they form a unique fingerprint.

    Cite this