A practically implementable and tractable delegation logic
A practically implementable and tractable delegation logic
复制标题
一个实际可实现且易于处理的委托逻辑
DOI：
10.1109/secpri.2000.848444
复制
发表时间：
2000
期刊：
影响因子：
--
通讯作者：
J. Feigenbaum
中科院分区：
文献类型：
--
作者：
Ninghui Li;Benjamin N. Grosof;J. Feigenbaum
我们的目标是使委托逻辑（DL）成为一个实际可实现的和易处理的信任管理系统。DL（N. Li等人，1999）是基于逻辑的知识表示（即，语言）用于大规模、开放式、分布式系统中的授权。DL推理在计算上是难以处理的，并且实现起来非常不切实际。我们引入了一个新版本的委托逻辑，以弥补这些困难。为了实现这一点，我们施加了一个句法限制，并重新定义了语义。我们表明，对于DL的这个修订版本，在普通逻辑程序（OLP）推理易于处理的相同常见限制下，推理在计算上易于处理（例如，每个规则的逻辑变量的数据量和有界数量）。我们给这个版本的DL的实现架构，它使用一个代表团编译器从DL到OLP，可以模块化地利用各种现有的OLP推理引擎。作为概念证明，我们已经使用这个架构实现了这个版本的DL的一个大的表达子集。
We address the goal of making Delegation Logic (DL) into a practically implementable and tractable trust management system. DL (N. Li et al., 1999) is a logic based knowledge representation (i.e., language) for authorization in large scale, open, distributed systems. DL inferencing is computationally intractable and highly impractical to implement. We introduce a new version of Delegation Logic that remedies these difficulties. To achieve this, we impose a syntactic restriction and redefine the semantics somewhat. We show that, for this revised version of DL, inferencing is computationally tractable under the same commonly met restrictions for which Ordinary Logic Programs (OLP) inferencing is tractable (e.g., Datalog and bounded number of logical variables per rule). We give an implementation architecture for this version of DL; it uses a delegation compiler from DL to OLP and can modularly exploit a variety of existing OLP inference engines. As proof of concept, we have implemented a large expressive subset of this version of DL, using this architecture.