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 FTn(ŁPi1/2) built up over the many-valued logic ŁPi1/2. In particular, we enlarge the ŁPi1 language by means of a binary modality says acting on pairs (pi,f) 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,f) as the degree of confidence the principal pi puts in the assertion f. For FTn(ŁPi1/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 Tn(ŁPi1/2) to allow principals to be hierarchically organized.

A complete fuzzy logical system to deal with trust management systems

PINNA, GIOVANNI MICHELE;
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 FTn(ŁPi1/2) built up over the many-valued logic ŁPi1/2. In particular, we enlarge the ŁPi1 language by means of a binary modality says acting on pairs (pi,f) 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,f) as the degree of confidence the principal pi puts in the assertion f. For FTn(ŁPi1/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 Tn(ŁPi1/2) to allow principals to be hierarchically organized.
2008
Fuzzy Logic; Trust Management Systems; Completeness
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11584/22616
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 11
  • ???jsp.display-item.citation.isi??? 7
social impact