Inference rules for OWL-P in N3Logic

Journal Title: Annals of Computer Science and Information Systems - Year 2018, Vol 17, Issue

Abstract

This paper presents OWL-P that is a lightweight formalism of OWL2. Before proposing our solution we have analyzed the OWL fragment that is actually used on the Web. OWL-P supports easy inferences by omitting complex language constructs. Moreover, we present inference rules for the proposal. Our formalization is based on Notation 3 Logic, which extended RDF by logical symbols and created the Semantic Web logic for deductive RDF graph stores. We also tested experimentally our OWL-P how it deals with real data for reasoning.

Authors and Affiliations

Dominik Tomaszuk

Keywords

Related Articles

Representation Matters: An Unexpected Property of Polynomial Rings and its Consequences for Formalizing Abstract Field Theory

In this paper we develop a Mizar formalization of Kronecker's construction, which states that for every field $F$ and irreducible polynomial $p \in F[X]$ there exists a field extension $E$ of $F$ such that $p$ has a root...

Data Compression Measures for Meta-Learning Systems

An important issue in building predictive models is the ability to quickly assess various aspects of the achievable performance of the model to know what outcome we can expect and how to optimally build the model. As ins...

Towards a Supportive City with Smart Urban Objects in the Internet of Things: The Case of Adaptive Park Bench and Adaptive Light

Internet of things technology is a key driver to build smart city infrastructure. The potentials for urban management problems which require process control and allocation mechanisms has long been acknowledged. However,...

Usability Of An E-Commerce Website Using Information Mining and Artificial Intelligence

Everyday a number of people are launching new websites of which many are e-Commerce websites. E-Commerce website means business and to have business they have to be useful to the customer. So, it is very important for th...

The Use of Gamification for Teaching Algorithms

This paper presents our experience using gamification principles into the free and open-source learning management system Moodle for aiding and abetting our Computer Science students in learning algorithms. In this work,...

Download PDF file
  • EP ID EP568234
  • DOI 10.15439/2018F102
  • Views 22
  • Downloads 0

How To Cite

Dominik Tomaszuk (2018). Inference rules for OWL-P in N3Logic. Annals of Computer Science and Information Systems, 17(), 27-33. https://europub.co.uk/articles/-A-568234