Sciweavers

65 search results - page 1 / 13
» Correcting Access Restrictions to a Consequence
Sort
View
DLOG
2011
12 years 7 months ago
Correcting Access Restrictions to a Consequence More Flexibly
Recent research has shown that labeling ontologies can be useful for restricting the access to some of the axioms and their implicit consequences. However, the labeling of the axio...
Eldora, Martin Knechtel, Rafael Peñaloza
ESWS
2010
Springer
13 years 9 months ago
A Generic Approach for Correcting Access Restrictions to a Consequence
Recent research has shown that annotations are useful for representing access restrictions to the axioms of an ontology and their implicit consequences. Previous work focused on as...
Martin Knechtel, Rafael Peñaloza
DLOG
2010
13 years 2 months ago
Correcting Access Restrictions to a Consequence
Recent research has shown that annotations are useful for representing access restrictions to the axioms of an ontology and their implicit consequences. Previous work focused on co...
Martin Knechtel, Rafael Peñaloza
TOCL
2008
113views more  TOCL 2008»
13 years 4 months ago
Abstract state machines capture parallel algorithms: Correction and extension
State Machines Capture Parallel Algorithms: Correction and Extension ANDREAS BLASS University of Michigan and YURI GUREVICH Microsoft Research We consider parallel algorithms worki...
Andreas Blass, Yuri Gurevich
CSFW
2006
IEEE
13 years 10 months ago
Non-Interference in Constructive Authorization Logic
We present a constructive authorization logic where the meanings of connectives are defined by their associated inference rules. This ensures that the logical reading of access c...
Deepak Garg, Frank Pfenning