In this paper we approach trust management systems in a fuzzy logical setting. The idea is to provide a generalization of the classical framework, where trust is understood via the dichotomy “true–false”. In order to overcome the classical approach proposed by Weeks, following the ideas used by Hájek, Esteva, Godo and others to deal with probability, possibility, and necessity in a many-valued logical setting, we introduce the modal logic FT n(Ł1/2) built up over the many-valued logic Ł1/2 . In particular, we enlarge the Ł1/2 language by means of a binary modality says acting on pairs (pi ,) of principals and assertions, where a principal is a propositional variable and an assertion is a propositional formula of a suited many-valued logic. The idea is to regard the evaluation of the modal formula says(pi , ) as the degree of confidence the principal pi puts in the assertion . For FT n(Ł1/2 ) we introduce a syntax, a semantic and we show completeness. Then we discuss the validity of generalized modus ponens rule in our setting. Finally we deal with a Pavelka-style extension of our logic, and we also extend FT n(Ł1/2 ) to allow principals to be hierarchically organized.
Flaminio, T., Pinna, G.M., Tiezzi, E.B.P. (2008). A complete fuzzy logical system to deal with trust management systems. FUZZY SETS AND SYSTEMS, 159(10), 1191-1207 [10.1016/j.fss.2007.12.007].
A complete fuzzy logical system to deal with trust management systems
FLAMINIO, TOMMASO;PINNA, GIOVANNI MICHELE;TIEZZI, ELISA BENEDETTA PRIMAVERA
2008-01-01
Abstract
In this paper we approach trust management systems in a fuzzy logical setting. The idea is to provide a generalization of the classical framework, where trust is understood via the dichotomy “true–false”. In order to overcome the classical approach proposed by Weeks, following the ideas used by Hájek, Esteva, Godo and others to deal with probability, possibility, and necessity in a many-valued logical setting, we introduce the modal logic FT n(Ł1/2) built up over the many-valued logic Ł1/2 . In particular, we enlarge the Ł1/2 language by means of a binary modality says acting on pairs (pi ,) of principals and assertions, where a principal is a propositional variable and an assertion is a propositional formula of a suited many-valued logic. The idea is to regard the evaluation of the modal formula says(pi , ) as the degree of confidence the principal pi puts in the assertion . For FT n(Ł1/2 ) we introduce a syntax, a semantic and we show completeness. Then we discuss the validity of generalized modus ponens rule in our setting. Finally we deal with a Pavelka-style extension of our logic, and we also extend FT n(Ł1/2 ) to allow principals to be hierarchically organized.File | Dimensione | Formato | |
---|---|---|---|
a complete fuzzy.pdf
non disponibili
Tipologia:
Altro materiale allegato
Licenza:
NON PUBBLICO - Accesso privato/ristretto
Dimensione
296.61 kB
Formato
Adobe PDF
|
296.61 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11365/25168
Attenzione
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo