α-Minimal Resolution Principle For A Lattice-Valued Logic
Based on the academic ideas of resolution-based automated reasoning and the previously established research work on binary α-resolution based automated reasoning schemes in the framework of lattice-valued logic with truth-values in a lattice algebraic structure-lattice implication algebra...
Main Authors: | Hairui Jia, Yang Xu, Yi Liu, Jun Liu |
---|---|
Format: | Article |
Language: | English |
Published: |
Atlantis Press
2015-01-01
|
Series: | International Journal of Computational Intelligence Systems |
Subjects: | |
Online Access: | https://www.atlantis-press.com/article/25868575.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) -
Non-Clausal Multi-ary α-Generalized Resolution Calculus for a Finite Lattice-Valued Logic
by: Yang Xu, et al.
Published: (2018-01-01) -
α-Generalized Semantic Resolution Method in Linguistic Truth-valued Propositional Logic P(X)
by: Jiafeng Zhang, et al.
Published: (2014-01-01) -
α-Quasi-Lock Semantic Resolution Method Based on Lattice-Valued Logic
by: Xiaomei Zhong, et al.
Published: (2014-06-01)