利用基数约束规则编程消解ECA策略冲突

ECA policy conflict resolution by utilizing cardinality constraint rule programming

为实现ECA策略冲突的自动、灵活消解,提出一种利用基数约束规则编程的新方法。基数约束规则编程是一种基于稳态模型语义的非单调逻辑编程技术,具有解决组合及其优化问题的良好性质。先后完成了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 precise- ness, high automatization and definite hierarchy. More importantly, it expands the domain of resolved conflict