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

DOI10.1093/JIGPAL/JZR007MaRDI QIDQ2905643zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Recommendations

• On compatibilities of -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)\)
• -group quasi-lock semantic resolution method based on lattice-valued propositional logic LP(X)

Cited in

(10)

• On compatibilities of -lock resolution method in linguistic truth-valued lattice-valued logic
• -paramodulation method for a lattice-valued logic L_nF(X) with equality
• \(\alpha\)-resolution fields of generalized literals in lattice-valued propositional logic \(L_{n\times 2}P(X)\)
• Comparisons among \(\alpha\)-generalized resolution methods in \(\mathcal L_{n\times 2}\)F(X)
• -group quasi-lock semantic resolution method based on lattice-valued propositional logic LP(X)
• scientific article; zbMATH DE number 1839652 (Why is no real title available?)
• Determination of \(\alpha \)-resolution in lattice-valued first-order logic \(\mathrm{LF}(X)\)
• \(\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)\)
• A unified algorithm for finding \(k\)-IESFs in linguistic truth-valued lattice-valued propositional 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)