摘要
提出访问控制的逻辑描述方法,满足最小模型语义的条件(不含负逻辑),并分析访问控制逻辑程序中不动点的迭代计算方法。通过迭代计算,得到访问控制逻辑程序的最小Herbrand模型——Mp。使用基于逻辑程序的方法对访问控制策略进行了较为精确的推理。
This paper presents a logical means for expressing access control,which satisfies the condition of least model semantic that has no negative,and analyzes an iterative algorithm for calculating the fixpoint of the logic program corresponding to the access control.According to the iterative algorithm,it calculates the least Herbrand model of logic program corresponding to the access control.Access control strategy is reasoned,through logical program,which makes reasoning of access control effectively.
出处
《计算机工程》
CAS
CSCD
北大核心
2008年第8期77-79,共3页
Computer Engineering
