一种策略冲突的消解方法

摘要

By using the nonmonotonic logic programming technology , Chomicki et al .proposed an ap-proach to resolve policy conflict .Although the approach is efficient , reliable , and has good encapsula-tion, its application domain is limited .On the base of Chomicki ’ s approach , we firstly define combina-tion conflict that is more general than common policy conflict .Then, we introduce an optimal solution for combination conflict resolution , i.e., the largest action-acceptance set , and show the important property of the smallest action-cancellation set as the complement of the solution .Lastly, the logic program for combination conflict resolution is constructed by using weight constraint rule programming technology with the stable model semantics .Because the logic program always has at least one stable mode , it is reliable to obtain an optimal solution according to a stable model of this program .%利用非单调逻辑编程技术，Chomicki等人提出了一种策略冲突消解方法。虽然该方法具有高效、可靠和良好的封装性等优点，但是它的应用域却受到限制。在Chomicki 方法的基础上，首先定义了组合冲突，它比一般策略冲突涵义更广。其次，为消解该类冲突引入了一个优化解—最大行动接受集，并给出与之互补的最小行动取消集的重要特性。最后，利用基于稳定模型语义的权约束规则编程技术，建立消解组合冲突的逻辑程序。由于该程序始终拥有稳定模型，所以总是能够根据它的模型获得优化解。