Minimal Deductive Systems for RDF

@inproceedings{Muoz2007MinimalDS,
  title={Minimal Deductive Systems for RDF},
  author={Sergio Mu{\~n}oz and Jorge P{\'e}rez and C. Guti{\'e}rrez},
  booktitle={ESWC},
  year={2007}
}
This paper presents a minimalist program for RDF, by showing how one can do without several predicates and keywords of the RDF Schema vocabulary, obtaining a simpler language which preserves the original semantics. This approach is beneficial in at least two directions: (a) To have a simple abstract fragment of RDFS easy to formalize and to reason about, which captures the essence of RDFS; (b) To obtain algorithmic properties of deduction and optimizations that are relevant for particular… Expand
Simple and Efficient Minimal RDFS
Logical Foundations of (e)RDF(S): Complexity and Reasoning
Foundations of Semantic Web databases
Foundations of RDF Databases
Defeasible RDFS via Rational Closure
dRDF: Entailment for Domain-Restricted RDF
SPARQLog: SPARQL with Rules and Quantification
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 35 REFERENCES
RDF Entailment as a Graph Homomorphism
Named graphs
FOAF Vocabulary Specification
Rdf vocabulary description language 1.0 : Rdf schema
Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics
Constraint Satisfaction
...
1
2
3
4
...