Reactive Policies for the Semantic Web

被引:0
作者
Bonatti, Piero A. [1 ]
Kaerger, Philipp [2 ]
Olmedilla, Daniel [3 ]
机构
[1] Univ Naples Federico II, Naples, Italy
[2] Leibniz Univ Hannover, L3S Res Ctr & Leibniz, Hannover, Germany
[3] Telefonica Res & Dev, Madrid, Spain
来源
SEMANTIC WEB: RESEARCH AND APPLICATIONS, PT 1, PROCEEDINGS | 2010年 / 6088卷
关键词
LANGUAGES;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Semantic Web policies are general statements defining the behavior of a system that acts on behalf of real users. These policies have various applications ranging from dynamic agent control to advanced access control policies. Although policies attracted a lot of research efforts in recent years, suitable representation and reasoning facilities allowing for reactive policies are not likewise developed. In this paper, we describe the concept of reactive Semantic Web policies. Reactive policies allow for the definition of events and actions, that is, they allow to define reactive behavior of a system acting on the Semantic Web. A reactive policy makes use of the tremendous amount of knowledge available on the Semantic Web in order to guide system behaviour while at the same time ensuring trusted and policy-compliant communication. We present a formal framework for expressing and enforcing such reactive policies in combination with advanced trust establishing techniques featuring an interplay between reactivity and agent negotiation. Finally, we explain how our approach was applied in a prototype which allows to define and enforce reactive Semantic Web policies on the Social Network and communication tool Skype.
引用
收藏
页码:76 / +
页数:3
相关论文
共 50 条
  • [41] Semantic Interoperability in Standardized Electronic Health Record Databases
    Sachdeva, Shelly
    Bhalla, Subhash
    ACM JOURNAL OF DATA AND INFORMATION QUALITY, 2012, 3 (01): : 1 - 37
  • [42] Reactive Imperative Programming with Dataflow Constraints
    Demetrescu, Camil
    Finocchi, Irene
    Ribichini, Andrea
    ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 2015, 37 (01):
  • [43] Defining Fairness in Reactive and Concurrent Systems
    Voelzer, Hagen
    Varacca, Daniele
    JOURNAL OF THE ACM, 2012, 59 (03)
  • [44] Asynchronous Functional Reactive Programming for GUIs
    Czaplicki, Evan
    Chong, Stephen
    ACM SIGPLAN NOTICES, 2013, 48 (06) : 411 - 422
  • [45] Modular refinement of hierarchic reactive machines
    Alur, R
    Grosu, R
    ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 2004, 26 (02): : 339 - 369
  • [46] Automating Formal Proofs for Reactive Systems
    Ricketts, Daniel
    Robert, Valentin
    Jang, Dongseok
    Tatlock, Zachary
    Lerner, Sorin
    ACM SIGPLAN NOTICES, 2014, 49 (06) : 452 - 462
  • [47] Maple: Simplifying SDN Programming Using Algorithmic Policies
    Voellmy, Andreas
    Wang, Junchang
    Yang, Y. Richard
    Ford, Bryan
    Hudak, Paul
    ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2013, 43 (04) : 87 - 98
  • [48] Design and Implementation of a Strong Representation System for Network Policies
    Lan, Fangping
    Biswas, Sanchari
    Qui, Bin
    Wu, Jie
    Wang, Anduo
    2022 31ST INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATIONS AND NETWORKS (ICCCN 2022), 2022,
  • [49] Reactive Imperative Programming with Dataflow Constraints
    Demetrescu, Camil
    Finocchi, Irene
    Ribichini, Andrea
    ACM SIGPLAN NOTICES, 2011, 46 (10) : 407 - 426
  • [50] Migration of Web Applications with Seamless Execution
    Oh, JinSeok
    Kwon, Jin-woo
    Park, Hyukwoo
    Moon, Soo-Mook
    ACM SIGPLAN NOTICES, 2015, 50 (07) : 173 - 185