Refinement of History-Based Policies

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 rule...

Full description

Saved in:
Bibliographic Details
Published inLogic Programming, Knowledge Representation, and Nonmonotonic Reasoning pp. 280 - 299
Main Authors Lobo, Jorge, Ma, Jiefei, Russo, Alessandra, Lupu, Emil, Calo, Seraphin, Sloman, Morris
Format Book Chapter
LanguageEnglish
Published Berlin, Heidelberg Springer Berlin Heidelberg 2011
SeriesLecture Notes in Computer Science
Subjects
Access Control Policy
Historical Condition
Logic Program
Policy Language
System Trace
Online AccessGet full text
ISBN3642208312
9783642208317
ISSN0302-9743
1611-3349
DOI10.1007/978-3-642-20832-4_18

Cover

More Information
Summary: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.
ISBN:3642208312
9783642208317
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-642-20832-4_18