KAoS policy management for semantic Web services

Uszok, Andrzej; Bradshaw, Jeffrey M.; Johnson, Matthew; Jeffers, Renia; Tate, Austin; Dalton, Jeff; Aitken, Stuart

doi:10.1109/mis.2004.31

Cited by 175 publications

(97 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Modelling such situations requires defeasible inheritance, i.e., properties transfer to all instances of a class by default, but can be explicitly overridden in special cases (McCarthy, 1986;Horty, 1994;Brewka, 1994;Baader & Hollunder, 1995b). The second application is the use of DLs as security policy languages (Uszok, Bradshaw, Johnson, Jeffers, Tate, Dalton, & Aitken, 2004;Kagal, Finin, & Joshi, 2003;Tonti, Bradshaw, Jeffers, Montanari, Suri, & Uszok, 2003). In formalizing access control policies, one must deal with the situation where a given request is neither explicitly allowed nor explicitly denied.…”

Section: Introductionmentioning

confidence: 99%

The Complexity of Circumscription in DLs

Bonatti¹,

Lutz²,

Wolter³

2009

jair

100

View full text Add to dashboard Cite

As fragments of first-order logic, Description logics (DLs) do not provide nonmonotonic features such as defeasible inheritance and default rules. Since many applications would benefit from the availability of such features, several families of nonmonotonic DLs have been developed that are mostly based on default logic and autoepistemic logic. In this paper, we consider circumscription as an interesting alternative approach to nonmonotonic DLs that, in particular, supports defeasible inheritance in a natural way. We study DLs extended with circumscription under different language restrictions and under different constraints on the sets of minimized, fixed, and varying predicates, and pinpoint the exact computational complexity of reasoning for DLs ranging from ALC to ALCIO and ALCQO. When the minimized and fixed predicates include only concept names but no role names, then reasoning is complete for NExp NP . It becomes complete for NP NExp when the number of minimized and fixed predicates is bounded by a constant. If roles can be minimized or fixed, then complexity ranges from NExp NP to undecidability.

show abstract

Section: Introductionmentioning

confidence: 99%

The Complexity of Circumscription in DLs

Bonatti¹,

Lutz²,

Wolter³

2009

jair

100

View full text Add to dashboard Cite

show abstract

“…Several approaches have been proposed in the literature for the specification of open MASsee, for example, [4,5,42,64,3,75,6,74,41,32,14,11,35,77]. An influential approach has been the work of Moses, Shoham, Tennenholtz and colleagues [49,50,67,68,73,25].…”

Section: Discussionmentioning

confidence: 99%

Executable specification of open multi-agent systems

Artikis

Sergot

2009

Logic Journal of IGPL

View full text Add to dashboard Cite

Abstract. Multi-agent systems where the agents are developed by parties with competing interests, and where there is no access to an agent's internal state, are often classified as 'open'. The members of such systems may inadvertently fail to, or even deliberately choose not to, conform to the system specification. Consequently, it is necessary to specify the normative relations that may exist between the members, such as permission, obligation, and institutional power. We present a framework being developed for executable specification of open multi-agent systems. We adopt a bird's eye view of these systems, as opposed to an agent's perspective whereby it reasons about how it should act. This paper is devoted to the presentation of various examples from the NetBill protocol formalised in terms of institutional power, permission and obligation. We express the system specification in the Event Calculus and execute the specification by means of a logic programming implementation. We also give several example formalisations of sanctions for dealing with violations of permissions and obligations. We distinguish between an open multi-agent system and the procedure by which an agent enters and leaves the system. We present examples from the specification of a role-management protocol for NetBill, and demonstrate the interplay between such a protocol and the corresponding multi-agent system.

show abstract

“…A distributed version of the KAoS Directory Service is currently being implemented. We are also studying possibilities for interaction among multiple instances of Policy Services [9].…”

Section: Kaos Ontologiesmentioning

confidence: 99%

“…KAoS is used in several applications ranging from the human-robotic teamwork for NASA and the Office of Naval Research [12], through massive societies of agents in the DARPA Ultralog project building next generation army logistic system, to Semantic Web Services interaction in the DARPA CoSAR-TS project [9] 6 . Here, we briefly present a summary of how KAoS has been integrated with Grid Computing services on the Globus platform (http://www.globus.org/) [10].…”

Section: Kaos Policy Applicationsmentioning

confidence: 99%

“…It already provides most of the generic mechanisms enumerated as required for the policy system to be integrated with a trust system, as enumerated in [7]. 7 Current work in the area of Semantic Web Services [9] will fill the gaps in the area of negotiation, necessary ontologies for credentials, and integration with existing PKI infrastructure. Our current prototypes integrating KAoS with grid computing security and credential mechanisms, as presented above, gives us confidence in the promise of future work in this same direction.…”

Section: Kaos Policy Applicationsmentioning

confidence: 99%

See 1 more Smart Citation

KAoS: A Policy and Domain Services Framework for Grid Computing and Semantic Web Services

Uszok

Bradshaw

Jeffers

2004

Lecture Notes in Computer Science

View full text Add to dashboard Cite

In this article we introduce KAoS, a policy and domain services framework based on W3C's OWL ontology language. KAoS was developed in response to the challenges presented by emerging semantic application requirements for infrastructure, especially in the area of security and trust management. The KAoS architecture, ontologies, policy representation, management and disclosure mechanisms are described. KAoS enables the specification and enforcement of both authorization and obligation policies. The use of ontologies as a source of policy vocabulary enables its extensibility. KAoS has been adapted for use in several applications and deployment platforms. We briefly describe its integration with the Globus Grid Computing environment.

show abstract

KAoS policy management for semantic Web services

Cited by 175 publications

References 14 publications

The Complexity of Circumscription in DLs

The Complexity of Circumscription in DLs

Executable specification of open multi-agent systems

KAoS: A Policy and Domain Services Framework for Grid Computing and Semantic Web Services

Contact Info

Product

Resources

About