Sciweavers

Share
SEMWEB
2004
Springer

Query Answering for OWL-DL with Rules

9 years 1 months ago
Query Answering for OWL-DL with Rules
Both OWL-DL and function-free Horn rules3 are decidable logics with interesting, yet orthogonal expressive power: from the rules perspective, OWL-DL is restricted to tree-like rules, but provides both existentially and universally quantified variables and full, monotonic negation. From the description logic perspective, rules are restricted to universal quantification, but allow for the interaction of variables in arbitrary ways. Clearly, a combination of OWL-DL and rules is desirable for building Semantic Web ontologies, and several such combinations have already been discussed. However, such a combination might easily lead to the undecidability of interesting reasoning problems. Here, we present a decidable such combination which is, to the best of our knowledge, more general than similar decidable combinations proposed so far. Decidability is obtained by restricting rules to so-called DL-safe ones, requiring each variable in a rule to occur in a non-DL-atom in the rule body. We sh...
Boris Motik, Ulrike Sattler, Rudi Studer
Added 02 Jul 2010
Updated 02 Jul 2010
Type Conference
Year 2004
Where SEMWEB
Authors Boris Motik, Ulrike Sattler, Rudi Studer
Comments (0)
books