On compatibilities of -lock resolution method in linguistic truth-valued lattice-valued logic
DOI10.1007/S00500-011-0779-ZzbMATH Open1255.03026OpenAlexW1976475080MaRDI QIDQ1933772FDOQ1933772
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 resolutioncompatibilitiesgeneralized deleting strategylinguistic truth-valued lattice-valued logic
Reasoning under uncertainty in the context of artificial intelligence (68T37) Fuzzy logic; logic of vagueness (03B52) Mechanization of proofs and logical operations (03B35)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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. III
- The concept of a linguistic variable and its application to approximate reasoning. II
- A Machine-Oriented Logic Based on the Resolution Principle
- Resolution decision procedures
- Resolution and model building in the infinite-valued calculus of Łukasiewicz
- Resolution-based theorem proving for many-valued logics
- Lattice-valued logic. An alternative approach to treat fuzziness and incomparability
- A fuzzy-set approach to treat determinacy and consistency of linguistic terms in multi-criteria decision making
- 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
- Computing with words in information/intelligent systems 1. Foundations
- \(\alpha\)-resolution principle based on first-order lattice-valued logic \(\text{LF}(X)\)
- On the consistency of rule bases based on lattice-valued first-order logic LF(X)
- \(\alpha\)-resolution principle based on lattice-valued propositional logic \(\text{LP} (X)\)
- Filter-based resolution principle for lattice-valued propositional logic LP\((X)\)
- Extracting the resolution algorithm from a completeness proof for the propositional calculus
- Using resolution for deciding solvable classes and building finite models
- On \(\alpha \)-satisfiability and its \(\alpha \)-lock resolution in a finite lattice-valued propositional logic
- Linear semi-look resolution
- Proof strategies in linear logic
- Approximate reasoning based on linguistic truth value with \(\alpha\)-operator
- Stratified resolution
- Connection methods in linear logic and proof nets construction
Cited In (6)
- Comparisons Among α-Generalized Resolution Methods in $$\fancyscript{L}_{n \times 2}$$F(X)
- \( \alpha \)-paramodulation method for a lattice-valued logic \(L_nF(X)\) with equality
- A unified algorithm for finding \(k\)-IESFs in linguistic truth-valued lattice-valued propositional logic
- \((\alpha, \beta)\)-ordered linear resolution of intuitionistic fuzzy propositional logic
- On the algebraic structure of binary lattice-valued fuzzy relations
- An axiomatizable logical foundation for lattice-ordered qualitative linguistic approach for reasoning with words
This page was built for publication: On compatibilities of \(\alpha \)-lock resolution method in linguistic truth-valued lattice-valued logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1933772)