Determination of 3-Ary -Resolution in Lattice-valued Propositional Logic LP(X)

Abstract

One of key issues for -() ary resolution automated reasoning based on lattice-valued logic with truth-value in a lattice implication algebra is to investigate the -() ary resolution of some generalized literals. In this article, the determination of -resolution of any 3-ary generalized literals which include the implication operators not more than 2 in LP(X). It not only lay the foundation for practical implementation of automated reasoning algorithm in LP(X), but also provides the strong support for -() ary resolution automated reasoning approaches.

Keywords

• Incomparability
• lattice implication algebra
• Lattice-valued logic
• automated reasoning
• – ary resolution