Query Answering for OWL-DL with rules.
Both OWL-DL and function-free Horn rules are decidable fragments of first-order logic with interesting, yet orthogonal expressive power. A combination of OWL-DL and rules is desirable for the Semantic Web; however, it might easily lead to the undecidability of interesting reasoning problems. Here, w...
Main Authors: | , , |
---|---|
Format: | Journal article |
Language: | English |
Published: |
2005
|
_version_ | 1797052243786072064 |
---|---|
author | Motik, B Sattler, U Studer, R |
author_facet | Motik, B Sattler, U Studer, R |
author_sort | Motik, B |
collection | OXFORD |
description | Both OWL-DL and function-free Horn rules are decidable fragments of first-order logic with interesting, yet orthogonal expressive power. A combination of OWL-DL and rules is desirable for the Semantic Web; however, it might easily lead to the undecidability of interesting reasoning problems. Here, we present a decidable such combination where rules are required to be DL-safe: each variable in the rule is required to occur in a non-DL-atom in the rule body. We discuss the expressive power of such a combination and present an algorithm for query answering in the related logic SHIQ extended with DL-safe rules, based on a reduction to disjunctive programs. © 2005 Elsevier B.V. All rights reserved. |
first_indexed | 2024-03-06T18:29:40Z |
format | Journal article |
id | oxford-uuid:09369355-baa7-47c0-8e9f-b5a9c17f913f |
institution | University of Oxford |
language | English |
last_indexed | 2024-03-06T18:29:40Z |
publishDate | 2005 |
record_format | dspace |
spelling | oxford-uuid:09369355-baa7-47c0-8e9f-b5a9c17f913f2022-03-26T09:17:03ZQuery Answering for OWL-DL with rules.Journal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:09369355-baa7-47c0-8e9f-b5a9c17f913fEnglishSymplectic Elements at Oxford2005Motik, BSattler, UStuder, RBoth OWL-DL and function-free Horn rules are decidable fragments of first-order logic with interesting, yet orthogonal expressive power. A combination of OWL-DL and rules is desirable for the Semantic Web; however, it might easily lead to the undecidability of interesting reasoning problems. Here, we present a decidable such combination where rules are required to be DL-safe: each variable in the rule is required to occur in a non-DL-atom in the rule body. We discuss the expressive power of such a combination and present an algorithm for query answering in the related logic SHIQ extended with DL-safe rules, based on a reduction to disjunctive programs. © 2005 Elsevier B.V. All rights reserved. |
spellingShingle | Motik, B Sattler, U Studer, R Query Answering for OWL-DL with rules. |
title | Query Answering for OWL-DL with rules. |
title_full | Query Answering for OWL-DL with rules. |
title_fullStr | Query Answering for OWL-DL with rules. |
title_full_unstemmed | Query Answering for OWL-DL with rules. |
title_short | Query Answering for OWL-DL with rules. |
title_sort | query answering for owl dl with rules |
work_keys_str_mv | AT motikb queryansweringforowldlwithrules AT sattleru queryansweringforowldlwithrules AT studerr queryansweringforowldlwithrules |