Research On Issues Of CSP And Group Optimization Based On E-CARGO

CSP (Constraint Satisfaction Problem, CSP) as an important branch of AI research for many years, usually is an NP-hard problem. A lot of problems in real life, can be used to model the constraint satisfaction problems, such as resource allocation scheduling, temporal reasoning and so on. In general, the constraint satisfaction problem consists of a finite set of variables, which are discrete and belong to a limited range. To solve the CSP problem, we should find a full assignment which does not violate any constraints.E-CARGO is made by Professor Zhu Haibin, a role-based collaborative modeling tools that can be effectively used in solving a series of constraint problems. In the E-CARGO model, a system can be described as a group of sigma, which contains<C,O, A, M, R, E, G, S0, H>. The model has good performance in dealing with the reality of the assignment problem in the assignment, such as football match formation, the hospital appointment scheduling problem. The application features of E-CARGO is not only the effectiveness of the application of system modeling, at the same time the relationship between the various roles system can be constructed clearly, and through the Group concept to optimize the system. The use of relationship between roles, such as inheritance, conflict and transformation, which can be applied in the RBAC system, and put forward the improvement strategy of RBAC system. Through the group concept, the intrusion detection system can be clearly defined, and according to the change of role transformation, we can carry on the optimization to the intrusion detection from the perspective of the role of cooperation. This model has made certain progress in the topological derivative and forecast, it starts from the system environment, and uses the conflict and inheritance relations between roles to given the forecast of the friendship.Role-based collaboration is a set of method, theory and technology which is used to explore the role and the complex relationship among them. In the RBC, Group Role Assignment is a key problem and also is a difficult problem. Many researchers often solve GRA problems based on a Qualification Matrix. But it is difficult to describe the complex constraint relationships of the problems with only one Matrix.Therefore, in this paper after adding a constraint set to the E-CARGO model, we put forward the Ec-CARGO model with constraints. And we also deeply study the intrinsic relationships among the RBC, GRA, SAT, and CSP, then produce the transformation relation of RBC-GRA-SAT-CSP. We propose a method of solving typical CSP constraint satisfaction problems based on Ec-CARGO, and design a common framework of solving CSP problems with the constraint assignment of GRA. Finally, we use the N-queen problem and the graph coloring problem to verify effectiveness of the assignment to solve the CSP problem with GRA constraints. In that way, we can prove that E-CARGO and CSP are equivalent to some degree and dealing with engineering problems with E-CARGO can be effectively used methods of CSP, as well as the engineering solution can be introduced into CSP.