RDF Surfaces: Computer Says No

05/15/2023
by   Patrick Hochstenbach, et al.
0

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 reasoning process. We created RDF Surfaces in order to express the full expressivity of FOL including saying explicitly `no'. This vision paper provides basic principles and compares existing work. Even though support for FOL is semi-decidable, we argue these problems are surmountable. RDF Surfaces span many use cases, including describing misuse of information, adding explainability and trust to reasoning, and providing scope for reasoning over streams of data and queries. RDF Surfaces provide the direct translation of FOL for the Semantic Web. We hope this vision paper attracts new implementers and opens the discussion to its formal specification.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/31/2011

Reasoning in the OWL 2 Full Ontology Language using First-Order Automated Theorem Proving

OWL 2 has been standardized by the World Wide Web Consortium (W3C) as a ...
research
05/20/2009

Interpretations of the Web of Data

The emerging Web of Data utilizes the web infrastructure to represent an...
research
09/11/2018

Resource-driven Substructural Defeasible Logic

Linear Logic and Defeasible Logic have been adopted to formalise differe...
research
11/14/2019

Tractable reasoning about Agent Programming in Dynamic Preference Logic

While several BDI logics have been proposed in the area of Agent Program...
research
05/10/2022

A Specification Logic for Programs in the Probabilistic Guarded Command Language (Extended Version)

The semantics of probabilistic languages has been extensively studied, b...
research
01/02/2020

Rethinking Defeasible Reasoning: A Scalable Approach

Recent technological advances have led to unprecedented amounts of gener...
research
10/16/2012

Heuristic Ranking in Tightly Coupled Probabilistic Description Logics

The Semantic Web effort has steadily been gaining traction in the recent...

Please sign up or login with your details

Forgot password? Click here to reset