Filter-based resolution principle for lattice-valued propositional logic LP(X)

DOI10.1016/J.INS.2006.07.027zbMATH Open1114.03019OpenAlexW2005769316MaRDI QIDQ867665FDOQ867665

Authors: Jun Ma, Wenjiang Li, Yang Xu, Da Ruan 

Publication date: 16 February 2007

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

Full work available at URL: https://doi.org/10.1016/j.ins.2006.07.027

Recommendations

• \(\alpha\)-resolution principle based on lattice-valued propositional logic \(\text{LP} (X)\)
• \(\alpha\)-resolution principle based on first-order lattice-valued logic \(\text{LF}(X)\)
• \(\alpha\)-resolution principle with generalized quantifier based on the first-order lattice-valued logic \(LF(X)\)
• Ideal resolution principle for lattice-valued first-order logic based on lattice implication algebra
• The logical properties of filters of lattice implication algebra
• Logical properties of lattice filter of lattice implication algebra
• scientific article; zbMATH DE number 679715
• scientific article; zbMATH DE number 1933130
• General form of \(\alpha\)-resolution principle for linguistic truth-valued lattice-valued logic
• Uncertainty reasoning based on the lattice-valued propositional logic LP\((X)\)

zbMATH Keywords

filterautomated reasoninglattice-valued logicresolution principlecomplex generalized clauselattice-implication algebrasimple generalized clause

Mathematics Subject Classification ID

Fuzzy logic; logic of vagueness (03B52) Mechanization of proofs and logical operations (03B35)

Cites Work

• On Fuzzy Logic I Many‐valued rules of inference
• Title not available (Why is that?)
• Title not available (Why is that?)
• Metamathematics of fuzzy logic
• Temporal resolution using a breadth-first search algorithm
• A treatise on many-valued logics
• A Machine-Oriented Logic Based on the Resolution Principle
• Evaluating general purpose automated theorem proving systems
• Efficiency and Completeness of the Set of Support Strategy in Theorem Proving
• Title not available (Why is that?)
• Eliminating dublication with the hyper-linking strategy
• Title not available (Why is that?)
• Title not available (Why is that?)
• Commodious axiomatization of quantifiers in multiple-valued logic
• MV-algebras, BL-algebras, \(R_0\)-algebras, and multiple-valued logic.
• Title not available (Why is that?)
• Resolution-based theorem proving for many-valued logics
• Lattice-valued logic. An alternative approach to treat fuzziness and incomparability
• The complexity of minimal satisfiability problems
• A perspective on certain polynomial-time solvable classes of satisfiability
• \(\alpha\)-resolution principle based on first-order lattice-valued logic \(\text{LF}(X)\)
• Completely non-clausal theorem proving
• A framework for automated reasoning in multiple-valued logics
• Graded many-valued resolution with aggregation.
• A new fuzzy resolution principle based on the antonym
• \(L\)-valued propositional logic \(L_{\text{vpl}}\)
• Inference in a multivalued logic system
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• ON SEMANTICS OF L-VALUED FIRST-ORDER LOGIC L_vft
• Resolution principles in possibilistic logic
• Reductions for non-clausal theorem proving
• Mechanical Theorem-Proving by Model Elimination
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Backjumping for quantified Boolean logic satisfiability
• Decidability by resolution for propositional modal logics
• Optimal axiomatizations for multiple-valued operators and quantifiers based on semi-lattices
• Complexity of resolution proofs and function introduction
• \(T\)-resolution: Refinements and model elimination
• A two-phase algorithm for solving a class of hard satisfiability problems
• Labelled resolution for classical and non-classical logics
• On resolution with short clauses
• \(T\)-theorem proving. I
• Title not available (Why is that?)
• Title not available (Why is that?)
• Fuzzy temporal constraint logic: A valid resolution principle

Cited In (15)

• \(J\)-resolution fields of generalized literals of \(L_{14}P (X)\)
• General form of \(\alpha\)-resolution principle for linguistic truth-valued lattice-valued logic
• Title not available (Why is that?)
• \(\alpha\)-resolution principle based on first-order lattice-valued logic \(\text{LF}(X)\)
• \(\alpha\)-resolution principle based on lattice-valued propositional logic \(\text{LP} (X)\)
• Graded many-valued resolution with aggregation.
• On \(v\)-filters and normal \(v\)-filters of a residuated lattice with a weak \(vt\)-operator
• A unified algorithm for finding \(k\)-IESFs in linguistic truth-valued lattice-valued propositional logic
• Lattice implication ordered semigroups
• Ideal resolution principle for lattice-valued first-order logic based on lattice implication algebra
• On the algebraic structure of binary lattice-valued fuzzy relations
• Determination of \(\alpha \)-resolution in lattice-valued first-order logic \(\mathrm{LF}(X)\)
• Linguistic truth-valued lattice-valued propositional logic system \(\ell P(X)\) based on linguistic truth-valued lattice implication algebra
• Fuzzy prime filters of lattice implication algebras
• On compatibilities of \(\alpha \)-lock resolution method in linguistic truth-valued lattice-valued logic

Uses Software

• OTTER
• DISCOUNT
• CLIN

This page was built for publication: Filter-based resolution principle for lattice-valued propositional logic LP\((X)\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q867665)