• Corpus ID: 10388736

Inferencing and Truth Maintenance in RDF Schema

  title={Inferencing and Truth Maintenance in RDF Schema},
  author={Jeen Broekstra and Arjohn Kampman},
Contrary to earlier reports in literature, exhaustive forward inferencing is a feasible approach for practical RDF. It is sufficiently fast and the increase in necessary storage size is sufficiently small to make it work. Benefits of this approach are low-cost design and implementation, and very cheap query answering, since this task is reduced to simple lookup without inferencing. A potential problem of exhaustive forward inferencing is how to deal with statement deletion (an aspect often… 

Tables from this paper

Time - Space Trade-Offs in Scaling up RDF Schema Reasoning
This paper develops a new approach for RDF reasoning that only computes a small part of the implied statements offline thereby reducing space requirements, upload time and maintenance overhead and allows to perform online reasoning without using a dedicated inference engine.
Backward inference and pruning for RDF change detection using RDBMS
This paper proposes a scalable change detection scheme for RDF data, which is based on backward-chaining inference and pruning, and can reduce the number of inference triples for R DF change detection by 10–60%.
Reasoning strategies for semantic Web rule languages
Over the course of this thesis, several kinds of reasoners including backward, forward, and hybrid reasoners for RDF rule languages were written, used for a variety of problems and data in a wide range of settings for solving real world problems.
An RDF Storage and Query Framework with Flexible Inference Strategy
A RDF storage and query framework with flexible inference strategy, which can combine forward and backward chaining inference strategies, and a new solution to the deletion operation is given within this framework.
DynamiTE: Parallel Materialization of Dynamic RDF Data
The results show that the methods are indeed capable to recalculate the derivation in a short time, opening the door to reasoning on much more dynamic data than is currently possible.
The cost of reasoning with RDF updates
  • Sana Al Azwari, John N. Wilson
  • Computer Science
    Proceedings of the 2015 IEEE 9th International Conference on Semantic Computing (IEEE ICSC 2015)
  • 2015
This paper experimentally provides a detailed analysis of the overall process of RDF change detection techniques namely: explicit change detection, forward-inference change Detection, backward-Inference change detection and backward- inference and pruning change detection.
An Investigation into Improving RDF Store Performance
For individuals and organisations to be willing to use Semantic Web technologies, data stores must advance beyond their current state, and there are several areas with opportunities for development, including scalability, low latency querying, distributed and federated stores, and improved support for updates and deletions.
Processing complex RDF queries over P2P networks
A DHT-based peer-2-peer network storing knowledge in the form of RDF triples is described, which combines expressivity and scalability, and an example application stemming from the Semantic Grid is described.
An Approach to RDF(S) Query, Manipulation and Inference on Databases
This paper proposes an approach to the storage, query, manipulation and inference of large RDF(S) data on top of relational databases that is done on the database in advance instead of on the fly, so that the query efficiency is maximized.
Efficient query answering against dynamic RDF databases
This work devise novel sound and complete techniques for answering Basic Graph Pattern queries within the DB fragment of RDF, exploring the two established approaches for handling RDF semantics, namely reformulation and saturation and proposes a method for incrementally maintaining the saturation.


Taking the RDF Model Theory Out for a Spin
This paper gives some results in the investigation of a practical implementation of the entailment rules of RDF, based on the graph-walking query mechanism of the WILBUR RDF toolkit.
Sesame: A Generic Architecture for Storing and Querying RDF and RDF Schema
This work presents an overview of Sesame, an architecture for efficient storage and expressive querying of large quantities of metadata in RDF and RDF Schema, and its implementation and the first experiences with this implementation.
A Truth Maintenance System
  • J. Doyle
  • Computer Science
    Artif. Intell.
  • 1979
Resource description framework (RDF) schema specification
The abbreviation RDF stands for the “Resource Description Framework” in the specification with classes and properties that originate with RDF Schema. RDFa (Resource Description Framework in
Towards the Semantic Web: Ontology-driven Knowledge Management
From the Publisher: "Towards the Semantic Web focuses on the application of Semantic Web technology and ontologies in particular to electronically available information to improve the quality of
Analysis and Design
By assuming controller structures in Chapter 2 we have generated several examples of closed-loop characteristic polynomials p(s, q,k), where the vector k contains the free design parameters in the
The truth, the whole truth, and nothing but the truth
While avoiding relativism, Rorty claims that: (1) truth is just for a time and a place; (2) ‘truth’ and ‘rationality’ are indexed to a community's standards of warranted assertibility; and (3) there
Owl web ontology language guide
This document demonstrates the use of the OWL language to formalize a domain by defining classes and properties of those classes, define individuals and assert properties about them, and reason about these classes and individuals to the degree permitted by the formal semantics of theOWL language.
Resource Description Framework (RDF) Model and Syntax Specification