A calculus for access control in distributed systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Understanding Trust Management Systems
SP '01 Proceedings of the 2001 IEEE Symposium on Security and Privacy
A logic for reasoning about the probability of fuzzy events
Fuzzy Sets and Systems
Mixed Rational Assessments of Possibility and Probability Measures
Electronic Notes in Theoretical Computer Science (ENTCS)
A zero-layer based fuzzy probabilistic logic for conditional probability
ECSQARU'05 Proceedings of the 8th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
A calculus for trust management
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
A many valued representation and propagation of trust and distrust
WILF'05 Proceedings of the 6th international conference on Fuzzy Logic and Applications
Probabilistic Dynamic Belief Logic for Image and Reputation
Proceedings of the 2008 conference on Artificial Intelligence Research and Development: Proceedings of the 11th International Conference of the Catalan Association for Artificial Intelligence
Aggregation of Trust for Iterated Belief Revision in Probabilistic Logics
SUM '09 Proceedings of the 3rd International Conference on Scalable Uncertainty Management
A fuzzy trust evaluation method for knowledge sharing in virtual enterprises
Computers and Industrial Engineering
Reputation-based decisions for logic-based cognitive agents
Autonomous Agents and Multi-Agent Systems
Computers and Industrial Engineering
| Hi-index | 0.20 |
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 Hajek, Esteva, Godo and others to deal with probability, possibility, and necessity in a many-valued logical setting, we introduce the modal logic FT"n(L@P12) built up over the many-valued logic L@P12. In particular, we enlarge the L@P12 language by means of a binary modality says acting on pairs (p"i,@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(p"i,@f) as the degree of confidence the principalp"iputs in the assertion@f. For FT"n(L@P12) 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(L@P12) to allow principals to be hierarchically organized.