On compatibilities of \(\alpha \)-lock resolution method in linguistic truth-valued lattice-valued logic
From MaRDI portal
Publication:1933772
DOI10.1007/s00500-011-0779-zzbMath1255.03026MaRDI QIDQ1933772
Yang Xu, Xingxing He, Shuwei Chen, Jun Liu
Publication date: 25 January 2013
Published in: Soft Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00500-011-0779-z
\(\alpha \)-linear resolution; \(\alpha \)-linear semi-lock resolution; \(\alpha \)-lock resolution; compatibilities; generalized deleting strategy; linguistic truth-valued lattice-valued logic
03B52: Fuzzy logic; logic of vagueness
68T37: Reasoning under uncertainty in the context of artificial intelligence
03B35: Mechanization of proofs and logical operations
Related Items
\((\alpha, \beta)\)-ordered linear resolution of intuitionistic fuzzy propositional logic, A unified algorithm for finding \(k\)-IESFs in linguistic truth-valued lattice-valued propositional logic, An axiomatizable logical foundation for lattice-ordered qualitative linguistic approach for reasoning with words, On the algebraic structure of binary lattice-valued fuzzy relations, \( \alpha \)-paramodulation method for a lattice-valued logic \(L_nF(X)\) with equality, Comparisons Among α-Generalized Resolution Methods in $$\fancyscript{L}_{n \times 2}$$F(X)
Cites Work
- Determination of \(\alpha \)-resolution in lattice-valued first-order logic \(\mathrm{LF}(X)\)
- Extracting the resolution algorithm from a completeness proof for the propositional calculus
- Filter-based resolution principle for lattice-valued propositional logic LP\((X)\)
- A fuzzy-set approach to treat determinacy and consistency of linguistic terms in multi-criteria decision making
- Linguistic truth-valued lattice-valued propositional logic system \(\ell P(X)\) based on linguistic truth-valued lattice implication algebra
- Linear semi-look resolution
- The concept of a linguistic variable and its application to approximate reasoning. I
- The concept of a linguistic variable and its application to approximate reasoning. II
- The concept of a linguistic variable and its application to approximate reasoning. III
- Resolution and model building in the infinite-valued calculus of Łukasiewicz
- Approximate reasoning based on linguistic truth value with \(\alpha\)-operator
- Proof strategies in linear logic
- Stratified resolution
- Lattice-valued logic. An alternative approach to treat fuzziness and incomparability
- Connection methods in linear logic and proof nets construction
- Resolution-based theorem proving for many-valued logics
- Computing with words in information/intelligent systems 1. Foundations
- On -satisfiability and its -lock resolution in a finite lattice-valued propositional logic
- Using resolution for deciding solvable classes and building finite models
- On the consistency of rule bases based on lattice-valued first-order logic LF(X)
- A Machine-Oriented Logic Based on the Resolution Principle
- \(\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)\)
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
