Inference rules for RDF(S) and OWL in N3Logic

TL;DR

This paper introduces inference rules for RDF, RDFS, and OWL using Notation 3 Logic, including a lightweight OWL formalism called OWL-P that enables flexible reasoning in Semantic Web applications.

Contribution

It formalizes inference rules for RDF, RDFS, and OWL within Notation 3 Logic and proposes OWL-P, a lightweight OWL subset supporting soft inferences.

Findings

Formalization of RDF, RDFS, and OWL inference rules in N3Logic

Introduction of OWL-P, a lightweight OWL formalism

Support for soft inferences in OWL-P

Abstract

This paper presents inference rules for Resource Description Framework (RDF), RDF Schema (RDFS) and Web Ontology Language (OWL). Our formalization is based on Notation 3 Logic, which extended RDF by logical symbols and created Semantic Web logic for deductive RDF graph stores. We also propose OWL-P that is a lightweight formalism of OWL and supports soft inferences by omitting complex language constructs.