Interpreting SWRL Rules in RDF Graphs

Authors:
Jing Mei;Harold Boley
Affiliations:
Department of Information Science, Peking University, Beijing 100871, China;Institute for Information Technology - e-Business, National Research Council of Canada, Fredericton, NB, E3B 9W4, Canada
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2006

Citing 5
Cited 4

{\cal A}{\cal L}-log: Integrating Datalog and Description Logics

Journal of Intelligent Information Systems
Description logic programs: combining logic programs with description logic

WWW '03 Proceedings of the 12th international conference on World Wide Web
A proposal for an owl rules language

Proceedings of the 13th international conference on World Wide Web
The Abstract Syntax of RuleML - Towards a General Web Rule Language Framework

WI '04 Proceedings of the 2004 IEEE/WIC/ACM International Conference on Web Intelligence
A tableaux decision procedure for SHOIQ

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence

Identifying Potentially Important Concepts and Relations in an Ontology

ISWC '08 Proceedings of the 7th International Conference on The Semantic Web
Ontology-based curriculum content sequencing system with semantic rules

Expert Systems with Applications: An International Journal
Modeling environmental process using semantic geospatial web service

W2GIS'07 Proceedings of the 7th international conference on Web and wireless geographical information systems
Enabling semantic web inferencing with oracle technology: applications in life sciences

RuleML'05 Proceedings of the First international conference on Rules and Rule Markup Languages for the Semantic Web

Quantified Score

Hi-index	0.00

Visualization

Abstract

An unresolved issue in SWRL (the Semantic Web Rule Language) is whether the intended semantics of its RDF representation can be described as an extension of the W3C RDF semantics. In this paper we propose to make the model-theoretic semantics of SWRL compatible with RDF by interpreting SWRL rules in RDF graphs. For dealing with SWRL/RDF rules, we regard 'Implies' as an OWL class, and extract all 'Implies' rules from an RDF database that represents a SWRL knowledge base. Each 'Implies' rule is grounded through mappings built into the semantic conditions of the model theory. Based on the fixpoint semantics, a bottom-up strategy is employed to compute the least Herbrand models.