@article{5ba5978592b6424392ecd8ee388597c5,
title = "On α-satisfiability and its α-lock resolution in a finite lattice-valued propositional logic",
abstract = "Automated reasoning issues are addressed for a finite lattice-valued propositional logic LnP(X) with truth-values in a finite lattice-valued logical algebraic structure-lattice implication algebra. We investigate extended strategies and rules from classical logic to LnP(X) to simplify the procedure in the semantic level for testing the satisfiability of formulas in LnP(X) at a certain truth-value level α (α-satisfiability) while keeping the role of truth constant formula played in LnP(X). We propose a lock resolution method at a certain truth-value level α (α-lock resolution) in LnP(X) and have proved its theorems of soundness and weak completeness, respectively. We provide more efficient resolution based automated reasoning in LnP(X) and key supports for α-resolution-based automated reasoning approaches and algorithms in lattice based linguistic truth-valued logic.",
keywords = "Finite lattice-valued propositional logic, Lattice-valued logic, α-lock resolution method, α-resolution principle, α-satisfiability",
author = "Xingxing He and Jun Liu and Yang Xu and Luis Mart{\'i}nez and Da Ruan",
year = "2012",
month = jun,
doi = "10.1093/jigpal/jzr007",
language = "English",
volume = "20",
pages = "579--588",
journal = "Logic Journal of the IGPL",
issn = "1367-0751",
publisher = "Oxford University Press",
number = "3",
}