Expressive fuzzy description logics over lattices
Knowledge-Based Systems
Fuzzy Description Logics and t-norm based fuzzy logics
International Journal of Approximate Reasoning
Belief functions on MV-algebras of fuzzy events based on fuzzy evidence
ECSQARU'11 Proceedings of the 11th European conference on Symbolic and quantitative approaches to reasoning with uncertainty
Electronic Notes in Theoretical Computer Science (ENTCS)
Finite-valued Lukasiewicz modal logic Is PSPACE-complete
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Reasoning about fuzzy belief and common belief: with emphasis on incomparable beliefs
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Logics for belief functions on MV-algebras
International Journal of Approximate Reasoning
Structural analysis of indistinguishability operators and related concepts
Information Sciences: an International Journal
Simulation for lattice-valued doubly labeled transition systems
International Journal of Approximate Reasoning
Kripke Semantics for Modal Bilattice Logic
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Gödel Homomorphisms as Gödel Modal Operators
Fundamenta Informaticae - MFCS & CSL 2010 Satellite Workshops: Selected Papers
| Hi-index | 0.00 |
This article deals with many-valued modal logics, based only on the necessity operator, over a residuated lattice. We focus on three basic classes, according to the accessibility relation, of Kripke frames: the full class of frames evaluated in the residuated lattice (and so defining the minimum modal logic), the ones evaluated in the idempotent elements and the ones only evaluated in 0 and 1. We show how to expand an axiomatization, with canonical truth-constants in the language, of a finite residuated lattice into one of the modal logic, for each one of the three basic classes of Kripke frames. We also provide axiomatizations for the case of a finite MV chain but this time without canonical truth-constants in the language.