DBAILOJan 11, 2016

Inference rules for RDF(S) and OWL in N3Logic

arXiv:1601.02650v16 citations
Originality Synthesis-oriented
AI Analysis

This work addresses the need for deductive reasoning in Semantic Web applications, but it appears incremental as it builds on existing Notation 3 Logic.

The paper tackles the problem of formalizing inference rules for RDF, RDFS, and OWL by proposing a formalization based on Notation 3 Logic and introducing OWL-P, a lightweight formalism that supports soft inferences by omitting complex constructs.

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.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes