ECA policy conflict resolution by utilizing cardinality constraint rule programming
利用基数约束规则编程消解ECA策略冲突

For realizing to automatically and flexibly resolve ECA policy conflict, this paper proposed a novel method which utilized cardinality constraint programming. The cardinality constraint programming was a kind of nonmonotonic logic programming technology with the stable model semantics, and it had the merits of solving combinational and combinational optimization problems. This paper successively accomplished the logic programming representation for ECA policy, the definition of action constraint which was used to detect and prevent conflict, the analysis for the conflict with the combinational character, the creation of cardinality constraint rule program which was used to resolve conflict. This method has the merits of logical preciseness, high automatization and definite hierarchy. More importantly, it expands the domain of resolved conflict.