Sciweavers

187 search results - page 28 / 38
» Reasoning about Duplicate Elimination with Description Logic
Sort
View
CCS
2005
ACM
14 years 28 days ago
PeerAccess: a logic for distributed authorization
This paper introduces the PeerAccess framework for reasoning about authorization in open distributed systems, and shows how a parameterization of the framework can be used to reas...
Marianne Winslett, Charles C. Zhang, Piero A. Bona...
WWW
2006
ACM
14 years 1 months ago
ASDL: a wide spectrum language for designing web services
A Service oriented system emerges from composition of services. Dynamically composed reactive Web services form a special class of service oriented system, where the delays associ...
Monika Solanki, Antonio Cau, Hussein Zedan
JAPLL
2007
88views more  JAPLL 2007»
13 years 7 months ago
Some comments on history based structures
History based models, introduced by Parikh and Ramanujam, provide a natural mathematical model of social interactive situations. These models offer a ”low level” description ...
Eric Pacuit
CSL
2010
Springer
13 years 8 months ago
Ordered Sets in the Calculus of Data Structures
Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints...
Viktor Kuncak, Ruzica Piskac, Philippe Suter
ENC
2005
IEEE
14 years 1 months ago
SKIMA: Semantic Knowledge and Information Management
This paper describes SKIMA, a mediation system that gives transparent access to heterogeneous and distributed sources considering their semantics and the semantics of application ...
Héctor Pérez-Urbina, Gennaro Bruno, ...