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

DOI

10.1080/18756891.2013.808802How to use a DOI?

Keywords

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

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.

Copyright

© 2017, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - JOUR
AU  - Yi Liu
AU  - Hairui Jia
AU  - Yang Xu
PY  - 2013
DA  - 2013/09/01
TI  - Determination of 3-Ary -Resolution in Lattice-valued Propositional Logic LP(X)
JO  - International Journal of Computational Intelligence Systems
SP  - 943
EP  - 953
VL  - 6
IS  - 5
SN  - 1875-6883
UR  - https://doi.org/10.1080/18756891.2013.808802
DO  - 10.1080/18756891.2013.808802
ID  - Liu2013
ER  -