<?xml version="1.0"?>

<!DOCTYPE owl [
  <!ENTITY rdf "http://www.w3.org/1999/02/22-rdf-syntax-ns#">
  <!ENTITY rdfs "http://www.w3.org/2000/01/rdf-schema#">
  <!ENTITY xsd "http://www.w3.org/2001/XMLSchema#">
  <!ENTITY owl "http://www.w3.org/2002/07/owl#">
  <!ENTITY cc "http://web.resource.org/cc/#">
  <!ENTITY event "http://ebiquity.umbc.edu/ontology/event.owl#">
  <!ENTITY person "http://ebiquity.umbc.edu/ontology/person.owl#">
  <!ENTITY assert "http://ebiquity.umbc.edu/ontology/assertion.owl#">]>

<!--
  This ontology document is licensed under the Creative Commons
  Attribution License. To view a copy of this license, visit
  http://creativecommons.org/licenses/by/2.0/ or send a letter to
  Creative Commons, 559 Nathan Abbott Way, Stanford, California
  94305, USA.
-->

<rdf:RDF 
  xmlns:rdf = "&rdf;"
  xmlns:rdfs = "&rdfs;"
  xmlns:xsd = "&xsd;"
  xmlns:owl = "&owl;"
  xmlns:cc = "&cc;"
  xmlns:event = "&event;"
  xmlns:person = "&person;"
  xmlns:assert = "&assert;">
  <event:Event rdf:about="http://ebiquity.umbc.edu/event/html/id/149/A-policy-based-system-to-determine-access-control-in-RDF-stores">
    <rdfs:label><![CDATA[A policy-based system to determine access control in RDF stores]]></rdfs:label>
    <event:title><![CDATA[A policy-based system to determine access control in RDF stores]]></event:title>
    <event:speaker><person:MSAlumnus rdf:about="http://ebiquity.umbc.edu/person/html/Pavan/Reddivari/"><person:name><![CDATA[Pavan  Reddivari]]></person:name><rdfs:label><![CDATA[Pavan  Reddivari]]></rdfs:label></person:MSAlumnus></event:speaker>
    <event:startDate rdf:datatype="&xsd;dateTime">2006-04-28T12:00:00-05:00</event:startDate>
    <event:endDate rdf:datatype="&xsd;dateTime">2006-04-28T01:30:00-05:00</event:endDate>
    <event:location><![CDATA[ITE 346]]></event:location>
    <event:abstract><![CDATA[Resource Description Format (RDF) stores have formed an
essential part of many semantic web applications. Current RDF
store systems have primarily focused on efficiently storing
and querying large numbers of triples. Little attention has
been given to how triples would be updated and maintained or
how access to store can be controlled.
<p>
In RDF stores addition and deletion of facts are not atomic,
addition of a fact might result in addition of other
knowledge, than the one added and similarly deletion of a fact
might lead to deletion of other knowledge, which was derived
using the fact being deleted. Current access control
mechanisms are mostly indigent to this aspect of the system.
We propose a policy based mechanism to determine access
control for a Resource Description Format (RDF) store.
<p>
In our implementation RDF-Store Access-Control Policies (RAP)
we provide a RDF store with maintenance capabilities and
access control using user defined policies.  All actions to
the store are routed through RAP policy engine, to determine
whether the action is permitted or prohibited. In the RAP
framework, the same RDF store is also used to store the
policy, as well as meta-data about the triples, allowing
greater range in policy specification.
]]></event:abstract>
    <event:host><person:PrincipalFaculty rdf:about="http://ebiquity.umbc.edu/person/html/Tim/Finin/"><person:name><![CDATA[Tim  Finin]]></person:name><rdfs:label><![CDATA[Tim  Finin]]></rdfs:label></person:PrincipalFaculty></event:host>
  </event:Event>

  <rdf:Description rdf:about="">
    <cc:License rdf:resource="http://creativecommons.org/licenses/by/2.0/" />
  </rdf:Description>

</rdf:RDF>
