Comparisons among -generalized resolution methods in L_n 2F(X)
DOI10.1007/978-3-642-54924-3_4zbMATH Open1356.68218OpenAlexW147149094MaRDI QIDQ2963698FDOQ2963698
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
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)\)
lattice-valued logic\(\alpha\)-generalized linear resolution\(\alpha\)-generalized lock resolution\(\alpha\)-generalized semantic resolution
Analysis of algorithms (68W40) Reasoning under uncertainty in the context of artificial intelligence (68T37) Logic in artificial intelligence (68T27)
Cites Work
- A Machine-Oriented Logic Based on the Resolution Principle
- Lattice-valued logic. An alternative approach to treat fuzziness and incomparability
- Completely non-clausal theorem proving
- On compatibilities of \(\alpha \)-lock resolution method in linguistic truth-valued lattice-valued logic
- On \(\alpha \)-satisfiability and its \(\alpha \)-lock resolution in a finite lattice-valued propositional 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)