Simple and Efficient Minimal RDFS

@article{Muoz2009SimpleAE,
  title={Simple and Efficient Minimal RDFS},
  author={Sergio Mu{\~n}oz and Jorge P{\'e}rez and C. Guti{\'e}rrez},
  journal={J. Web Semant.},
  year={2009},
  volume={7},
  pages={220-234}
}
The original RDFS language design includes several features that hinder the task of developers and theoreticians. This paper has two main contributions in the direction of simplifying the language. First, it introduces a small fragment which, preserving the normative semantics and the core functionalities, avoids the complexities of the original specification, and captures the main semantic functionalities of RDFS. Second, it introduces a minimalist deduction system over this fragment, which by… Expand
The Logic of Extensional RDFS
Towards In-Memory RDFS Entailment
Logical Foundations of RDF(S) with Datatypes
Completeness Management for RDF Data Sources
Extending LiteMat toward RDFS++
Defeasible RDFS via Rational Closure
Completeness Statements about RDF Data Sources and Their Use for Query Answering
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 24 REFERENCES
Minimal Deductive Systems for RDF
Logical Reconstruction of RDF and Ontology Languages
Logical Foundations of (e)RDF(S): Complexity and Reasoning
Foundations of Semantic Web databases
RDF Entailment as a Graph Homomorphism
A possible simplification of the semantic web architecture
Completeness, decidability and complexity of entailment for RDF Schema and a semantic extension involving the OWL vocabulary
Named graphs
RDFS(FA) and RDF MT: Two Semantics for RDFS
...
1
2
3
...