Refinement of history-based policies

Abstract

We propose an efficient method to evaluate a large class of history-based policies written as logic programs. To achieve this, we dynamically compute, from a given policy set, a finite subset of the history required and sufficient to evaluate the policies. We maintain this history by monitoring rules and transform the policies into a non history-based form. We further formally prove that evaluating history-based policies can be reduced to an equivalent, but more efficient, evaluation of the non history-based policies together with the monitoring rules. © 2011 Springer-Verlag Berlin Heidelberg.