Filter-based resolution principle for lattice-valued propositional logic LP\((X)\)
From MaRDI portal
Publication:867665
DOI10.1016/j.ins.2006.07.027zbMath1114.03019OpenAlexW2005769316MaRDI QIDQ867665
Yang Xu, Jun Ma, Wenjiang Li, 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
automated reasoningfilterlattice-valued logicresolution principlecomplex generalized clauselattice-implication algebrasimple generalized clause
Related Items (9)
General form of \(\alpha\)-resolution principle for linguistic truth-valued lattice-valued logic ⋮ On compatibilities of \(\alpha \)-lock resolution method in linguistic truth-valued lattice-valued logic ⋮ A unified algorithm for finding \(k\)-IESFs in linguistic truth-valued lattice-valued propositional logic ⋮ Fuzzy prime filters of lattice implication algebras ⋮ On the algebraic structure of binary lattice-valued fuzzy relations ⋮ On \(v\)-filters and normal \(v\)-filters of a residuated lattice with a weak \(vt\)-operator ⋮ Lattice implication ordered semigroups ⋮ 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
Uses Software
Cites Work
- Eliminating dublication with the hyper-linking strategy
- Backjumping for quantified Boolean logic satisfiability
- Resolution principles in possibilistic logic
- Completely non-clausal theorem proving
- Complexity of resolution proofs and function introduction
- A framework for automated reasoning in multiple-valued logics
- Decidability by resolution for propositional modal logics
- \(T\)-resolution: Refinements and model elimination
- A two-phase algorithm for solving a class of hard satisfiability problems
- Metamathematics of fuzzy logic
- Labelled resolution for classical and non-classical logics
- On resolution with short clauses
- Temporal resolution using a breadth-first search algorithm
- Lattice-valued logic. An alternative approach to treat fuzziness and incomparability
- Graded many-valued resolution with aggregation.
- A new fuzzy resolution principle based on the antonym
- Commodious axiomatization of quantifiers in multiple-valued logic
- Evaluating general purpose automated theorem proving systems
- \(L\)-valued propositional logic \(L_{\text{vpl}}\)
- A perspective on certain polynomial-time solvable classes of satisfiability
- The complexity of minimal satisfiability problems
- Resolution-based theorem proving for many-valued logics
- \(T\)-theorem proving. I
- Inference in a multivalued logic system
- On Fuzzy Logic I Many‐valued rules of inference
- Optimal axiomatizations for multiple-valued operators and quantifiers based on semi-lattices
- ON SEMANTICS OF L-VALUED FIRST-ORDER LOGIC Lvft
- Efficiency and Completeness of the Set of Support Strategy in Theorem Proving
- A Machine-Oriented Logic Based on the Resolution Principle
- Mechanical Theorem-Proving by Model Elimination
- \(\alpha\)-resolution principle based on first-order lattice-valued logic \(\text{LF}(X)\)
- Fuzzy temporal constraint logic: A valid resolution principle
- Reductions for non-clausal theorem proving
- 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: Filter-based resolution principle for lattice-valued propositional logic LP\((X)\)
