Interpreting SWRL Rules in RDF Graphs

Download
  1. (PDF, 344 KB)
AuthorSearch for: ; Search for:
TypeArticle
ConferenceProceedings of the International Workshop on Web languages and Formal Methods (WLFM 2005), 2006
Volume151
Issue2
SubjectSWRL rules; RDF graphs; model theory; fixpoint semantics; bottom-up strategy
AbstractAn 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.
Publication date
LanguageEnglish
AffiliationNRC Institute for Information Technology; National Research Council Canada
Peer reviewedNo
NRC number49313
NPARC number8914252
Export citationExport as RIS
Report a correctionReport a correction
Record identifierc64e150b-a77f-4331-bd01-b497464e2e87
Record created2009-04-22
Record modified2016-05-09
Bookmark and share
  • Share this page with Facebook (Opens in a new window)
  • Share this page with Twitter (Opens in a new window)
  • Share this page with Google+ (Opens in a new window)
  • Share this page with Delicious (Opens in a new window)