This demonstration will show the practical application of a formal reasoning engine for both policy invocation and policy reconciliation. The primary features of this demonstration include the use of formal ontologies, context based policy reasoning, and support for both policy invocation and reconciliation. BaseVISor [C. Matheus et al., 2006], a forward chaining inference engine optimized for reasoning about RDF triples, is the formal reasoning engine that we have extended to support automated reasoning about policies through the addition of context-based semantics introduced by cwm/REIN [L. Kagal and T. Berners-Lee, 2005] and a formal ontology that we have extended/developed based on concepts from REIN and Ismeme [P. McDaniel and A. Prakash, 2006]. We will demonstrate the system's application to some existing scenarios taken from the body of work described in [L. Kagal and T. Berners-Lee, 2005] and [P. McDaniel and A. Prakash, 2006].
[1]
Lalana Kagal,et al.
Rein : Where Policies Meet Rules in the Semantic Web
,
2005
.
[2]
Mieczyslaw M. Kokar,et al.
BaseVISor: A Triples-Based Inference Engine Outfitted to Process RuleML and R-Entailment Rules
,
2006,
2006 Second International Conference on Rules and Rule Markup Languages for the Semantic Web (RuleML'06).
[3]
Dan Brickley,et al.
Rdf vocabulary description language 1.0 : Rdf schema
,
2004
.
[4]
Atul Prakash,et al.
Methods and limitations of security policy reconciliation
,
2006,
TSEC.
[5]
Charles L. Forgy,et al.
Rete: a fast algorithm for the many pattern/many object pattern match problem
,
1991
.
[6]
Herman J. ter Horst,et al.
Combining RDF and Part of OWL with Rules: Semantics, Decidability, Complexity
,
2005,
SEMWEB.