\(\alpha\)-resolution principle based on first-order lattice-valued logic \(\text{LF}(X)\)

DOI10.1016/S0020-0255(01)00065-2zbMath0997.03006MaRDI QIDQ5946327

Etienne E. Kerre, Jun Liu, Yang Xu, Da Ruan

Publication date: 2 September 2002

Published in: Information Sciences (Search for Journal in Brave)

zbMATH Keywords

many-valued logiclattice-valued logicresolution principlelattice implication algebraresolution calculus

Mathematics Subject Classification ID

Related Items (18)

\( \alpha \)-paramodulation method for a lattice-valued logic \(L_nF(X)\) with equality ⋮ General form of \(\alpha\)-resolution principle for linguistic truth-valued lattice-valued logic ⋮ Filter-based resolution principle for lattice-valued propositional logic LP\((X)\) ⋮ On compatibilities of \(\alpha \)-lock resolution method in linguistic truth-valued lattice-valued logic ⋮ Lack of associative filters in lattice implication algebras ⋮ A unified algorithm for finding \(k\)-IESFs in linguistic truth-valued lattice-valued propositional logic ⋮ Lattice-valued modal propositional logic based on M-lattice implication algebras ⋮ Ideal resolution principle for lattice-valued first-order logic based on lattice implication algebra ⋮ \(ILI\)-ideals and prime \(LI\)-ideals in lattice implication algebras. ⋮ Multi-ary α-semantic resolution automated reasoning based on lattice-valued first-order logic LF (X)1 ⋮ Lattice implication ordered semigroups ⋮ Some kinds of falling fuzzy filters of lattice implication algebras ⋮ Fuzzy implicative and Boolean filters of \(R_{0}\) algebras ⋮ Determination of \(\alpha \)-resolution in lattice-valued first-order logic \(\mathrm{LF}(X)\) ⋮ On fuzzy ordered semigroups. ⋮ The Resolution Method for 10-Element Linguistic Truth-Valued Propositional Logic ⋮ On WLI-ideal space and the properties of WLI-ideals in lattice implication algebra (LIA) ⋮ \((\alpha, \beta)\)-ordered linear resolution of intuitionistic fuzzy propositional logic

Cites Work

• Resolution principles in possibilistic logic
• First-order fuzzy logic
• Completely non-clausal theorem proving
• Paraconsistent disjunctive deductive databases
• The completeness of gp-resolution for annotated logics
• Paraconsistent logic programming
• Filters and structure of lattice implication algebra
• \(L\)-valued propositional logic \(L_{\text{vpl}}\)
• The logic of inexact concepts
• Fuzzy sets in a approximate reasoning. I: Inference with possibility distributions
• Inference in a multivalued logic system
• On Fuzzy Logic I Many‐valued rules of inference
• ON SEMANTICS OF L-VALUED FIRST-ORDER LOGIC L_vft
• A Machine-Oriented Logic Based on the Resolution Principle
• Fuzzy sets
• Some properties of fuzzy logic
• The Specialization of Programs by Theorem Proving
• Fuzzy Logic and the Resolution Principle
• Axiom schemes for m-valued propositions calculi
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: \(\alpha\)-resolution principle based on first-order lattice-valued logic \(\text{LF}(X)\)