RDF Surfaces as a First-Order Language for the Semantic Web
From International Center for Computational Logic
RDF Surfaces as a First-Order Language for the Semantic Web
Dörthe ArndtDörthe Arndt, Jos De RooJos De Roo, Patrick HochstenbachPatrick Hochstenbach, Rebekka MartensRebekka Martens, Femke OngenaeFemke Ongenae, Mathijs van NoortMathijs van Noort
- ISBN: 978-3-031-72407-7
Dörthe Arndt, Jos De Roo, Patrick Hochstenbach, Rebekka Martens, Femke Ongenae, Mathijs van Noort
RDF Surfaces as a First-Order Language for the Semantic Web
In Sabrina Kirrane, Mantas Šimkus, Ahmet Soylu, Dumitru Roman, eds., Rules and Reasoning. RuleML+RR 2024, 200-216, September 2024. Springer
RDF Surfaces as a First-Order Language for the Semantic Web
In Sabrina Kirrane, Mantas Šimkus, Ahmet Soylu, Dumitru Roman, eds., Rules and Reasoning. RuleML+RR 2024, 200-216, September 2024. Springer
- KurzfassungAbstract
Inspired by the idea of RDF Redux, an RDF extension suggested by Pat Hayes, RDF Surfaces were recently developed and further specified by a W3C community group. The idea of RDF Surfaces is to add negation and explicit existential quantification to RDF and thereby gain the expressivity of first-order logic. RDF Surfaces come with a syntax and even with first implementations, but the semantics has so far only been defined informally. In this paper we aim to close this gap: we map RDF Surface graphs to first-order logic formulae and thereby define their semantics. We show that, restricted to RDF graphs, this semantics preserves simple entailment. That is, each RDF graph which entails another in its first-order translation, also entails this graph according to RDF's simple entailment and vice versa. To test whether this semantics fully meets the informal specification, we furthermore provide rs2fol, an implementation which follows our mapping and translates RDF Surfaces in N3-based syntax to first-order logic in TPTP syntax. We apply this implementation on the various examples collected on the Web page of the RDF Surfaces reasoner EYE, run them with the theorem prover Vampire and compare the results with those of EYE. With the exception of a different understanding of lists -- EYE treats these as first-class citizens -- results of both approaches coincide. We thus provides a tool for entailment checking which is conform to the current specification. This tool will help future developers of RDF Surfaces reasoners to test their derivations for correctness and the community as a whole to better understand the logic and - if needed - to refine or even restrict it. - Projekt:Project: ScaDS.AI
- Forschungsgruppe:Research Group: Computational LogicComputational Logic
@inproceedings{ARHMON2024,
author = {D{\"{o}}rthe Arndt and Jos De Roo and Patrick Hochstenbach and
Rebekka Martens and Femke Ongenae and Mathijs van Noort},
title = {RDF Surfaces as a First-Order Language for the Semantic Web},
editor = {Sabrina Kirrane and Mantas {\v{S}}imkus and Ahmet Soylu and
Dumitru Roman},
booktitle = {Rules and Reasoning. {RuleML+RR} 2024},
publisher = {Springer},
year = {2024},
month = {September},
pages = {200-216}
}