α-Generalized Semantic Resolution Method in Linguistic Truth-valued Propositional Logic P(X)
This paper is focused on α-generalized semantic resolution automated reasoning method in linguistic truth-valued lattice-valued propositional logic. Concretely, α-generalized semantic resolution for lattice-valued propositional logic ()P(X) is equivalently transformed into that f...
Main Authors: | Jiafeng Zhang, Yang Xu, Xingxing He |
---|---|
Format: | Article |
Language: | English |
Published: |
Atlantis Press
2014-01-01
|
Series: | International Journal of Computational Intelligence Systems |
Subjects: | |
Online Access: | https://www.atlantis-press.com/article/25868460.pdf |
Similar Items
-
Determination of 3-Ary -Resolution in Lattice-valued Propositional Logic LP(X)
by: Yi Liu, et al.
Published: (2013-09-01) -
α-Resolution Method for Lattice-valued Horn Generalized Clauses in Lattice-valued Propositional Logic Systems
by: Weitao Xu, et al.
Published: (2015-12-01) -
α-Quasi-Lock Semantic Resolution Method Based on Lattice-Valued Logic
by: Xiaomei Zhong, et al.
Published: (2014-06-01) -
α-Generalized lock resolution method in linguistic truth-valued lattice-valued logic
by: Xingxing He, et al.
Published: (2012-11-01) -
Non-Clausal Multi-ary α-Generalized Resolution Calculus for a Finite Lattice-Valued Logic
by: Yang Xu, et al.
Published: (2018-01-01)