## 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 ℒ _{vn}P(X). Secondly, similar equivalence between (c _{i} , f)-quasi-lock semantic resolution for ℒ _{v(n×2)}P(X) and that for ℒ _{vn}P(X) is also established under certain conditions.

Original language | English |
---|---|

Title of host publication | Foundations of Intelligent Systems |

Subtitle of host publication | Proceedings of the Sixth International Conference on Intelligent Systems and Knowledge Engineering, Shanghai, China, Dec 2011 (ISKE2011) |

Editors | Yinglin Wang, Tianrui Li |

Pages | 159-169 |

Number of pages | 11 |

DOIs | |

Publication status | Published (in print/issue) - 2011 |

### Publication series

Name | Advances in Intelligent and Soft Computing |
---|---|

Volume | 122 |

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 ℒ_{v(n×2)}P(X)'. Together they form a unique fingerprint.