Partial and Fuzzy Constraint Satisfaction to Support Coalition Formation
Author(s) -
Petros Belsis,
Stefanos Gritzalis,
Sokratis Katsikas
Publication year - 2007
Publication title -
electronic notes in theoretical computer science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.242
H-Index - 60
ISSN - 1571-0661
DOI - 10.1016/j.entcs.2006.08.032
Subject(s) - constraint satisfaction , constraint satisfaction problem , constraint (computer aided design) , computer science , constraint logic programming , access control , constraint programming , fuzzy logic , negotiation , domain (mathematical analysis) , task (project management) , perspective (graphical) , role based access control , mathematical optimization , artificial intelligence , computer security , mathematics , engineering , systems engineering , mathematical analysis , geometry , law , probabilistic logic , stochastic programming , political science
The creation of dynamic coalitions is a challenging task, seen from a security perspective. Due to the presence of conflicting requirements and specifications, the policy negotiation and policy merging processes call for the use of efficient techniques to resolve ambiguities. Constraints and constraint programming on the other hand, are useful means for representing a wide range of access control states and access control problems. In this paper we utilize constraints to represent access control policies in a multi-domain environment. In contrast to monolithic (crisp) constraint satisfaction techniques, we extend the applicability of constraints for access control, by examining soft constraints and partial constraint satisfaction. We also introduce a security framework based on fuzzy constraints that allows the determination of preferences for the participating domains
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom