Comparisons Among α-Generalized Resolution Methods in $$\fancyscript{L}_{n \times 2}$$F(X)
From MaRDI portal
Publication:2963698
DOI10.1007/978-3-642-54924-3_4zbMath1356.68218OpenAlexW147149094MaRDI QIDQ2963698
No author found.
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
lattice-valued logic\(\alpha\)-generalized linear resolution\(\alpha\)-generalized lock resolution\(\alpha\)-generalized semantic resolution
Analysis of algorithms (68W40) Logic in artificial intelligence (68T27) Reasoning under uncertainty in the context of artificial intelligence (68T37)
Cites Work
- Completely non-clausal theorem proving
- Lattice-valued logic. An alternative approach to treat fuzziness and incomparability
- On compatibilities of \(\alpha \)-lock resolution method in linguistic truth-valued lattice-valued logic
- On -satisfiability and its -lock resolution in a finite lattice-valued propositional logic
- A Machine-Oriented Logic Based on the Resolution Principle