A distributed tabling algorithm for rule based policy systems

Research output: Chapter in book/report/conference proceedingConference contributionResearchpeer review

Authors

Research Organisations

External Research Organisations

  • NOVA University Lisbon
View graph of relations

Details

Original languageEnglish
Title of host publicationProceedings
Subtitle of host publicationThirteenth International Symposium on Temporal Representation and Reasoning, TIME 2006
Pages123-132
Number of pages10
Publication statusPublished - 2006
Event7th IEEE International Workshop on Policies for Distributed Systems and Networks, Policy 2006 - London, ON, Canada
Duration: 5 Jun 20067 Jun 2006

Publication series

NameProceedings - Seventh IEEE International Workshop on Policies for Distributed Systems and Networks, Policy 2006
Volume2006

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.

ASJC Scopus subject areas

Cite this

A distributed tabling algorithm for rule based policy systems. / Alves, Miguel; Damásio, Carlos Viegas; Nejdl, Wolfgang et al.
Proceedings: Thirteenth International Symposium on Temporal Representation and Reasoning, TIME 2006. 2006. p. 123-132 1631164 (Proceedings - Seventh IEEE International Workshop on Policies for Distributed Systems and Networks, Policy 2006; Vol. 2006).

Research output: Chapter in book/report/conference proceedingConference contributionResearchpeer review

Alves, M, Damásio, CV, Nejdl, W & Olmedilla, D 2006, A distributed tabling algorithm for rule based policy systems. in Proceedings: Thirteenth International Symposium on Temporal Representation and Reasoning, TIME 2006., 1631164, Proceedings - Seventh IEEE International Workshop on Policies for Distributed Systems and Networks, Policy 2006, vol. 2006, pp. 123-132, 7th IEEE International Workshop on Policies for Distributed Systems and Networks, Policy 2006, London, ON, Canada, 5 Jun 2006. https://doi.org/10.1109/POLICY.2006.4
Alves, M., Damásio, C. V., Nejdl, W., & Olmedilla, D. (2006). A distributed tabling algorithm for rule based policy systems. In Proceedings: Thirteenth International Symposium on Temporal Representation and Reasoning, TIME 2006 (pp. 123-132). Article 1631164 (Proceedings - Seventh IEEE International Workshop on Policies for Distributed Systems and Networks, Policy 2006; Vol. 2006). https://doi.org/10.1109/POLICY.2006.4
Alves M, Damásio CV, Nejdl W, Olmedilla D. A distributed tabling algorithm for rule based policy systems. In Proceedings: Thirteenth International Symposium on Temporal Representation and Reasoning, TIME 2006. 2006. p. 123-132. 1631164. (Proceedings - Seventh IEEE International Workshop on Policies for Distributed Systems and Networks, Policy 2006). doi: 10.1109/POLICY.2006.4
Alves, Miguel ; Damásio, Carlos Viegas ; Nejdl, Wolfgang et al. / A distributed tabling algorithm for rule based policy systems. Proceedings: Thirteenth International Symposium on Temporal Representation and Reasoning, TIME 2006. 2006. pp. 123-132 (Proceedings - Seventh IEEE International Workshop on Policies for Distributed Systems and Networks, Policy 2006).
Download
@inproceedings{ae6ac27362fd4cc08b5213dea201e71c,
title = "A distributed tabling algorithm for rule based policy systems",
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.",
author = "Miguel Alves and Dam{\'a}sio, {Carlos Viegas} and Wolfgang Nejdl and Daniel Olmedilla",
year = "2006",
doi = "10.1109/POLICY.2006.4",
language = "English",
isbn = "0769525989",
series = "Proceedings - Seventh IEEE International Workshop on Policies for Distributed Systems and Networks, Policy 2006",
pages = "123--132",
booktitle = "Proceedings",
note = "7th IEEE International Workshop on Policies for Distributed Systems and Networks, Policy 2006 ; Conference date: 05-06-2006 Through 07-06-2006",

}

Download

TY - GEN

T1 - A distributed tabling algorithm for rule based policy systems

AU - Alves, Miguel

AU - Damásio, Carlos Viegas

AU - Nejdl, Wolfgang

AU - Olmedilla, Daniel

PY - 2006

Y1 - 2006

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

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

UR - http://www.scopus.com/inward/record.url?scp=33845417664&partnerID=8YFLogxK

U2 - 10.1109/POLICY.2006.4

DO - 10.1109/POLICY.2006.4

M3 - Conference contribution

AN - SCOPUS:33845417664

SN - 0769525989

SN - 9780769525983

T3 - Proceedings - Seventh IEEE International Workshop on Policies for Distributed Systems and Networks, Policy 2006

SP - 123

EP - 132

BT - Proceedings

T2 - 7th IEEE International Workshop on Policies for Distributed Systems and Networks, Policy 2006

Y2 - 5 June 2006 through 7 June 2006

ER -

By the same author(s)