Computer Science – Logic in Computer Science
Scientific paper
2005-10-21
Computer Science
Logic in Computer Science
This paper appears in the proceedings of the 1st International Workshop on Security and Trust Management (STM 2005). To appear
Scientific paper
Community decisions about access control in virtual communities are non-monotonic in nature. This means that they cannot be expressed in current, monotonic trust management languages such as the family of Role Based Trust Management languages (RT). To solve this problem we propose RT-, which adds a restricted form of negation to the standard RT language, thus admitting a controlled form of non-monotonicity. The semantics of RT- is discussed and presented in terms of the well-founded semantics for Logic Programs. Finally we discuss how chain discovery can be accomplished for RT-.
Czenko M.
Doumen Jeroen
Etalle Sandro
Hartel Pieter
Hartog den J.
No associations
LandOfFree
Nonmonotonic Trust Management for P2P Applications does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Nonmonotonic Trust Management for P2P Applications, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Nonmonotonic Trust Management for P2P Applications will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-89057