Inference in a multivalued logic system
International Journal of Man-Machine Studies
Resolution-based theorem proving for many-valued logics
Journal of Symbolic Computation
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
Fuzzy Logic and the Resolution Principle
Journal of the ACM (JACM)
A new fuzzy resolution principle based on the antonym
Fuzzy Sets and Systems
&agr;-resolution principle based on lattice-valued propositional logic LP(X)
Information Sciences: an International Journal
&agr;-resolution principle based on first-order lattice-valued logic LF (X)
Information Sciences: an International Journal
Symbolic Logic and Mechanical Theorem Proving
Symbolic Logic and Mechanical Theorem Proving
A Framework for Automated Reasoning in Multiple-Valued Logics
Journal of Automated Reasoning
On the consistency of rule bases based on lattice-valued first-order logic LF(X): Research Articles
International Journal of Intelligent Systems
Filter-based resolution principle for lattice-valued propositional logic LP(X)
Information Sciences: an International Journal
International Journal of Approximate Reasoning
Linguistic Values-based Intelligent Information Processing: Theory, Methods, and Applications
Linguistic Values-based Intelligent Information Processing: Theory, Methods, and Applications
L-valued propositional logic Lvpl
Information Sciences: an International Journal
Information Sciences: an International Journal
Determination of α-resolution in lattice-valued first-order logic LF(X)
Information Sciences: an International Journal
α-satisfiability and α-lock resolution for a lattice-valued logic LP(X)
HAIS'10 Proceedings of the 5th international conference on Hybrid Artificial Intelligence Systems - Volume Part II
A resolution-like strategy based on a lattice-valued logic
IEEE Transactions on Fuzzy Systems
Hi-index | 0.00 |
This paper focuses on resolution-based automated reasoning approaches in a lattice-valued first-order logic LF(X) with truth-values defined in a logical algebraic structure-lattice implication algebra (LIA), which aims at providing the logic foundation to represent and handle both imprecision and incomparability. In order to improve the efficiency of @a-resolution approach proposed for LF(X), firstly the concepts of @a-lock resolution principle and deduction are introduced for lattice-valued propositional logic LP(X) based on LIA, along with its soundness and weak completeness theorems. Then all the results are extended into LF(X) by using Lifting Lemma. Finally an @a-lock resolution automated reasoning algorithm in LF(X) is proposed for the implementation purpose. This work provides a theoretical foundation for more efficient resolution-based automated reasoning algorithm in lattice-valued logic LF(X).