Comparisons among -generalized resolution methods in L_n 2F(X)

DOI10.1007/978-3-642-54924-3_4MaRDI QIDQ2963698zbMATH OpenOpenAlexFDO

Authors

Publication date 21 February 2017

Published in Advances in Intelligent Systems and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-54924-3_4

zbMATH Keywords

lattice-valued logic\(\alpha\)-generalized linear resolution\(\alpha\)-generalized lock resolution\(\alpha\)-generalized semantic resolution

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Reasoning under uncertainty in the context of artificial intelligence (68T37) Logic in artificial intelligence (68T27)

Recommendations

• The comparability of \(\alpha\)-generalized semantic resolution method based on 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 fields of generalized literals of the logic \(\text{LP}(X)\)
• Generalized resolution and NC-resolution
• Determination of \(\alpha \)-resolution in lattice-valued first-order logic \(\mathrm{LF}(X)\)

Cites work

• A Machine-Oriented Logic Based on the Resolution Principle
• Completely non-clausal theorem proving
• Lattice-valued logic. An alternative approach to treat fuzziness and incomparability
• On \(\alpha \)-satisfiability and its \(\alpha \)-lock resolution in a finite lattice-valued propositional logic
• On compatibilities of -lock resolution method in linguistic truth-valued lattice-valued logic

This page was built for publication: Comparisons among \(\alpha\)-generalized resolution methods in \(\mathcal L_{n\times 2}\)F(X)

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