Inferencing and Truth Maintenance in RDF Schema

@inproceedings{Broekstra2003InferencingAT,
  title={Inferencing and Truth Maintenance in RDF Schema},
  author={Jeen Broekstra and Arjohn Kampman},
  booktitle={PSSS},
  year={2003}
}
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… CONTINUE READING
Highly Cited
This paper has 76 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 44 extracted citations

77 Citations

0510'06'09'12'15'18
Citations per Year
Semantic Scholar estimates that this publication has 77 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 11 references

OWL Web Ontology Language Guide

  • Michael Smith, Chris Welty, Deborah McGuinness
  • Working draft, World Wide Web Consortium (W3C),
  • 2003
2 Excerpts

RDF Model Theory

  • Patrick Hayes
  • Working Draft , World Wide Web Consortium
  • 2003

T wards the Semantic Web: Ontology-Driven Knowledge Management

  • John Davies, Dieter Fensel, Frank van Harmelen, editors
  • Ontology Middleware and Reasoning. Wiley & Sons…
  • 2002
1 Excerpt

Maintenance of transitive closure and transitive reduction of graphs

  • J. A. La Poutŕe, J. van Leeuwen
  • Workshop on Graph - Theoretic Concepts in…
  • 1988

Maintenance of transitive closure and transitive reduction of graphs. InWorkshop on Graph-Theoretic Concepts in Computer Science

  • J. A. La Poutŕ e, J. van Leeuwen
  • Lecture Notes in Computer Science,
  • 1988
1 Excerpt

Similar Papers

Loading similar papers…