Pith. sign in

REVIEW 1 cited by

Reasoning over RDF Knowledge Bases using Deep Learning

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1811.04132 v1 pith:SW7VLZWT submitted 2018-11-09 cs.LG cs.AIstat.ML

classification cs.LGcs.AIstat.ML
keywords knowledgedeductivereasoningalgorithmshighalternativeconsidereddata
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Semantic Web knowledge representation standards, and in particular RDF and OWL, often come endowed with a formal semantics which is considered to be of fundamental importance for the field. Reasoning, i.e., the drawing of logical inferences from knowledge expressed in such standards, is traditionally based on logical deductive methods and algorithms which can be proven to be sound and complete and terminating, i.e. correct in a very strong sense. For various reasons, though, in particular, the scalability issues arising from the ever-increasing amounts of Semantic Web data available and the inability of deductive algorithms to deal with noise in the data, it has been argued that alternative means of reasoning should be investigated which bear high promise for high scalability and better robustness. From this perspective, deductive algorithms can be considered the gold standard regarding correctness against which alternative methods need to be tested. In this paper, we show that it is possible to train a Deep Learning system on RDF knowledge graphs, such that it is able to perform reasoning over new RDF knowledge graphs, with high precision and recall compared to the deductive gold standard.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. xpSHACL: Explainable SHACL Validation using Retrieval-Augmented Generation and Large Language Models

    cs.DB 2025-07 conditional novelty 6.0 of 10

    xpSHACL combines a rule-based trace of why a SHACL constraint failed with RAG and an LLM to generate human-readable, cached explanations for RDF validation violations.

Pith tools