Correcting Access Restrictions to a Consequence

Martin KnechtelMartin Knechtel, Rafael PeñalozaRafael Peñaloza

Download

Martin Knechtel, Rafael Peñaloza
Correcting Access Restrictions to a Consequence
In Volker Haarslev and David Toman and Grant Weddell, eds., Proceedings of the 23rd International Workshop on Description Logics (DL 2010), volume 573 of CEUR-WS, 220-231, 2010

Details
Bibtex

KurzfassungAbstract
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 computing a consequence's access restriction efficiently from the restrictions of its implying axioms. However, a security administrator might not be satisfied since the intended restriction differs from the one obtained through these methods. In this case, one is interested in finding a minimal set of axioms which need changed restrictions. In this paper we look at this problem and present algorithms based on ontology repair for solving it. Our first experimental results on large scale ontologies show that our methods perform well in practice.
Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory

@inproceedings{ KnPe-DL-10,
  author = {Martin {Knechtel} and Rafael {Pe{\~n}aloza}},
  booktitle = {Proceedings of the 23rd International Workshop on Description Logics (DL 2010)},
  editor = {Volker {Haarslev} and David {Toman} and Grant {Weddell}},
  pages = {220--231},
  series = {CEUR-WS},
  title = {Correcting Access Restrictions to a Consequence},
  volume = {573},
  year = {2010},
}