Authorization plays an important role to control access to the system resources. It enforces security mechanism in compliance with the polices and rules specified by the security strategies. However, the security rules may not be always complete. In certain situations, we need to evaluate and reason about an incomplete security domain. In this paper, we propose an approach to reason under incomplete security domain by extended logic programs, discuss properties of unknown and conflict queries, and solve these problems by defining a procedure of evaluating the logic programs. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Bai, Y. (2008). Reasoning for i]ncomplete authorizations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5177 LNAI, pp. 278–285). Springer Verlag. https://doi.org/10.1007/978-3-540-85563-7_39
Mendeley helps you to discover research relevant for your work.