Ideal-Based Resolution Principle for Lattice-Valued Propositional Logic Lp(x)

Resolution in Linguistic Propositional Logic Based on Linear Symmetrical Hedge Algebra

“…Automated reasoning in linguistic logic has been attracting many researchers. Many works presented resolution algorithms in linguistic logics with truth value domain based on the implication lattice algebraic structures [2,3,15,16,19] or based on hedge algebra [4,8,10,11]. Along the line of these research directions, we study automated reasoning based on resolution for linguistic propositional logic with truth value domain is taken from linear symmetrical hedge algebra.…”

“…Automated reasoning in linguistic logic has been attracting many researchers. Many works presented resolution algorithms in linguistic logics with truth value domain based on the implication lattice algebraic structures [2,3,15,16,19] or based on hedge algebra [4,8,10,11].…”

α-Quasi-Lock Semantic Resolution Method Based on Lattice-Valued Logic

“…Taking the above ideas into consideration, the resolution principle based on lattice-valued logic with truth-value in a lattice-valued logical algebraic structure -lattice implication algebras was established by Xu et al [16][17], which can be used to prove whether a latticevalued logical formula is false at a truth-value level (i.e., -false) or not in order to characterize incomparability and fuzziness. After that, some researchers did further research on the theory of resolution-based automated reasoning for the above lattice-valued logic and obtained some important results.…”

α-ordered linear resolution method for lattice-valued logic system based on lattice implication algebra

“…Hence, non-classical logic (fuzzy logic or multi-valued logic) should be the appropriate foundation for automated reasoning with uncertainty, and has become an active research area. Due to common efforts of many researchers, both theory and applications in non-classical logic have been extensively developed in recent years (Morgan, 1976;Dubois et al, 1989;Dubois and Prade, 1990;Liu, 1994;Baaz and Fermuller, 1995;Liu, 1998;Xu et al, 2000bXu et al, , 2001bXu et al, , 2003Xu et al, , 2009.…”

“…Li et al (2008) established a new resolution method, which is magnifying or reducing resolution principle. Xu et al (2009) proposed an ideal-based resolution method for lattice-valued propositional logic system LP(X) and gave the completeness theorem on it. The determination of α-resolution for the generalised literals in lattice-valued first-order logic LF(X) is studied (Xu et al, 2011).…”