RDF Surfaces: Computer Says No
Patrick Hochstenbach, Jos De Roo, Ruben Verborgh

TL;DR
RDF Surfaces aim to enable full first-order logic expressivity on the Semantic Web, enhancing transparency, trust, and reasoning capabilities by explicitly supporting logical negation and complex expressions.
Contribution
This paper introduces RDF Surfaces, a novel approach to express the complete first-order logic on the Semantic Web, addressing limitations of current fragmentary logics.
Findings
RDF Surfaces support full FOL expressivity including 'no' statements.
They facilitate better reasoning, explainability, and trust in Semantic Web applications.
Support for FOL, despite semi-decidability, is considered feasible.
Abstract
Logic can define how agents are provided or denied access to resources, how to interlink resources using mining processes and provide users with choices for possible next steps in a workflow. These decisions are for the most part hidden, internal to machines processing data. In order to exchange this internal logic a portable Web logic is required which the Semantic Web could provide. Combining logic and data provides insights into the reasoning process and creates a new level of trust on the Semantic Web. Current Web logics carries only a fragment of first-order logic (FOL) to keep exchange languages decidable or easily processable. But, this is at a cost: the portability of logic. Machines require implicit agreements to know which fragment of logic is being exchanged and need a strategy for how to cope with the different fragments. These choices could obscure insights into the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSemantic Web and Ontologies · Logic, Reasoning, and Knowledge · Access Control and Trust
