A policy language for a pervasive computing environment

Kagal, Lalana; Finin, Tim; Joshi, Anupam

doi:10.1109/policy.2003.1206958

Cited by 321 publications

(221 citation statements)

References 16 publications

Supporting

Mentioning

216

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

“…Recent work on frameworks for distributed trust management and policy in multi-agent systems [17,18] and existing authentication and delegation logics have to be taken into consideration for future logical extensions of DAML+OIL. The first step will be the development of further basic ontologies for deontic concepts (permissions, obligations, and rights), as well as a basic agent and action ontology (requesting a resource, delegating rights, etc) [19]. A theory for reasoning about trust relations will be at the core of decision procedures for web agents that search for reliable information.…”

Section: Discussionmentioning

confidence: 99%

Security for DAML Web Services: Annotation and Matchmaking

Denker

Kagal

Finin

et al. 2003

Lecture Notes in Computer Science

112

View full text Add to dashboard Cite

Abstract. In the next generation of the Internet semantic annotations will enable software agents to extract and interpret web content more quickly than it is possible with current techniques. The focus of this paper is to develop security annotations for web services that are represented in DAML-S and used by agents. We propose several security-related ontologies that are designed to represent well-known security concepts. These ontologies are used to describe the security requirements and capabilities of web services providers and requesting agents. A reasoning engine decides whether agents and web service have comparable security characteristics. Our prototypical implementation uses the Java Theorem Prover from Stanford for deciding the degree to which the requirements and capabilities match based on our matching algorithm. The security reasoner is integrated with the Semantic Matchmaker from CMU giving it the ability to provide security brokering between agents and services.

show abstract

“…CoBrA's broker enforces privacy policies to define rules of behavior and restrict context (Kagal & T. A. Joshi, 2003) which does description logic inference over OWL. CoBrA also implements a meta-policy reasoning mechanism so that users can override some aspects of a global policy to define specific constraints at their desired level of granularity.…”

Section: Semantic Context Managementmentioning

confidence: 99%

Leveraging Semantic Technologies towards Social Ambient Intelligence

Joly

Maret

Bataille³

2010

Ubiquitous and Pervasive Computing

View full text Add to dashboard Cite

At a time when the amount of information grows exponentially on the Internet, when most people can be connected at all times with powerful personal devices, we need to enhance, adapt and simplify access to information and communication with other people. The vision of ambient intelligence which is a relevant solution, brings many challenges in the domain of contextawareness, adaptive human-system interaction, privacy enforcement and social communications. We believe that ontologies and other semantic technologies can help to meet most of these challenges in a unified manner, as they are a bridge between meaningful (but fuzzy by nature) human knowledge and digital information systems. In this chapter, we review several utilizations of semantic technologies for context management, adaptive human-system interaction, privacy enforcement and social communications in the scope of ubiquitous computing. Based on identified benefits and lacks, we propose several research leads towards the realization of a unified ubiquitous system based on the social web and semantic technologies.

show abstract

A policy language for a pervasive computing environment

Abstract: In this paper we describe a policy language designed for pervasive computing applications that is based on deontic

Cited by 321 publications

References 16 publications

The Complexity of Circumscription in DLs

The Complexity of Circumscription in DLs

Security for DAML Web Services: Annotation and Matchmaking

Leveraging Semantic Technologies towards Social Ambient Intelligence

Contact Info

Product

Resources

About