To Resolve Policy Conflict by Weight Constraint Rule Programming

To overcome the limitation of the approach proposed by Chomicki et ah, this paper presents a new methodology for policy conflict resolution. The property of action constraint instance set is studied, and an optimal solution for conflict resolution, i.e., the largest action-acceptance set, is introduced, and the general property of the smallest action-cancellation set as the complement of the solution is showed. Finally, the logic program for conflict resolution is constructed by utilizing weight constraint rule programming with the stable model semantics. Because the logic program always has at least one stable model, it is reliable to obtain an optimal solution according to a stable model of this program. The methodology proposed by this paper not only has the merits of Chomicki´s approach, but also expands the kinds of resolved conflicts.