On -satisfiability and its -lock resolution in a finite lattice-valued propositional logic

DOI10.1093/JIGPAL/JZR007zbMATH Open1257.03036OpenAlexW2166100649MaRDI QIDQ2905643FDOQ2905643

Authors: Xingxing He, Jun Liu, Yang Xu, Luis Martínez, Da Ruan 

Publication date: 28 August 2012

Published in: Logic Journal of the IGPL (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/jigpal/jzr007

Recommendations

• On compatibilities of \(\alpha \)-lock resolution method in linguistic truth-valued lattice-valued logic
• Determination of \(\alpha \)-resolution in lattice-valued first-order logic \(\mathrm{LF}(X)\)
• \(\alpha\)-resolution fields of generalized literals in lattice-valued propositional logic \(L_{n\times 2}P(X)\)
• \(\alpha\)-resolution principle based on lattice-valued propositional logic \(\text{LP} (X)\)
• \(\alpha\)-group quasi-lock semantic resolution method based on lattice-valued propositional logic \(LP(X)\)

zbMATH Keywords

lattice-valued logic\(\alpha \)-lock resolution method\(\alpha \)-resolution principle\(\alpha \)-satisfiabilityfinite lattice-valued propositional logic

Mathematics Subject Classification ID

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

Cited In (9)

• \(\alpha\)-resolution fields of generalized literals in lattice-valued propositional logic \(L_{n\times 2}P(X)\)
• 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)\)
• 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
• Determination of \(\alpha \)-resolution in lattice-valued first-order logic \(\mathrm{LF}(X)\)
• On compatibilities of \(\alpha \)-lock resolution method in linguistic truth-valued lattice-valued logic

This page was built for publication: On \(\alpha \)-satisfiability and its \(\alpha \)-lock resolution in a finite lattice-valued propositional logic

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