A Distributed Tabling Algorithm for Rule Based Policy Systems

Authors:
Miguel Alves;Carlos Viegas Damasio;Wolfgang Nejdl;Daniel Olmedilla
Affiliations:
Universidade Nova de Lisboa, Portugal;Universidade Nova de Lisboa, Portugal;L3S Research Center and Hannover University, Germany;L3S Research Center and Hannover University, Germany
Venue:
POLICY '06 Proceedings of the Seventh IEEE International Workshop on Policies for Distributed Systems and Networks
Year:
2006

Citing 0
Cited 4

Networked graphs: a declarative mechanism for SPARQL rules, SPARQL views and RDF data integration on the web

Proceedings of the 17th international conference on World Wide Web
A flexible architecture for privacy-aware trust management

Journal of Theoretical and Applied Electronic Commerce Research
Rule-based policy representation and reasoning for the semantic web

RW'07 Proceedings of the Third international summer school conference on Reasoning Web
A framework for modular ERDF ontologies

Annals of Mathematics and Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Distributed Peer-to-Peer and Grid infrastructure require distributed access control mechanisms. These mechanisms can be implemented in distributed trust management infrastructures and usually require reasoning on more than one peer, as soon as authority is delegated or requests involve several authorities. Building on previous work of the authors which formalized such a distributed trust management infrastructure based on distributed logic programs, we describe in this paper how reasoning can be implemented as distributed logic evaluation and how loops during this evaluation can be handled with. Our solution is based on a loop tolerant distributed tabling algorithm which includes in the process protection of sensitive policies and generation of proofs without increasing the complexity of the system.