RDF Surfaces: Computer Says No
- URL: http://arxiv.org/abs/2305.08476v1
- Date: Mon, 15 May 2023 09:27:46 GMT
- Title: RDF Surfaces: Computer Says No
- Authors: Patrick Hochstenbach, Jos De Roo, Ruben Verborgh
- Abstract summary: This vision paper provides basic principles and compares existing work.
We create RDF Surfaces in order to express the full expressivity of FOL including saying explicitly no'
RDF Surfaces provide the direct translation of FOL for the Semantic Web.
- Score: 0.22099217573031676
- License: http://creativecommons.org/licenses/by/4.0/
- 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 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.
Related papers
- Text-Video Retrieval with Global-Local Semantic Consistent Learning [122.15339128463715]
We propose a simple yet effective method, Global-Local Semantic Consistent Learning (GLSCL)
GLSCL capitalizes on latent shared semantics across modalities for text-video retrieval.
Our method achieves comparable performance with SOTA as well as being nearly 220 times faster in terms of computational cost.
arXiv Detail & Related papers (2024-05-21T11:59:36Z) - Inferentialist Resource Semantics [48.65926948745294]
In systems modelling, a system typically comprises located resources relative to which processes execute.
This paper shows how inferentialism enables a versatile and expressive framework for resource semantics.
arXiv Detail & Related papers (2024-02-14T14:54:36Z) - Language Models can be Logical Solvers [99.40649402395725]
We introduce LoGiPT, a novel language model that directly emulates the reasoning processes of logical solvers.
LoGiPT is fine-tuned on a newly constructed instruction-tuning dataset derived from revealing and refining the invisible reasoning process of deductive solvers.
arXiv Detail & Related papers (2023-11-10T16:23:50Z) - Modeling Hierarchical Reasoning Chains by Linking Discourse Units and
Key Phrases for Reading Comprehension [80.99865844249106]
We propose a holistic graph network (HGN) which deals with context at both discourse level and word level, as the basis for logical reasoning.
Specifically, node-level and type-level relations, which can be interpreted as bridges in the reasoning process, are modeled by a hierarchical interaction mechanism.
arXiv Detail & Related papers (2023-06-21T07:34:27Z) - Abstract Meaning Representation-Based Logic-Driven Data Augmentation for Logical Reasoning [27.224364543134094]
We introduce a novel logic-driven data augmentation approach, AMR-LDA.
AMR-LDA converts the original text into an Abstract Meaning Representation (AMR) graph.
The modified AMR graphs are subsequently converted back into text to create augmented data.
arXiv Detail & Related papers (2023-05-21T23:16:26Z) - APOLLO: A Simple Approach for Adaptive Pretraining of Language Models
for Logical Reasoning [73.3035118224719]
We propose APOLLO, an adaptively pretrained language model that has improved logical reasoning abilities.
APOLLO performs comparably on ReClor and outperforms baselines on LogiQA.
arXiv Detail & Related papers (2022-12-19T07:40:02Z) - How to Agree to Disagree: Managing Ontological Perspectives using
Standpoint Logic [2.9005223064604073]
Standpoint Logic is a simple, yet versatile multi-modal logic add-on'' for existing KR languages.
We provide a polytime translation into the standpoint-free version of First-Order Standpoint Logic.
We then establish a similar translation for the very expressive description logic SROIQb_s underlying the OWL 2 DL language.
arXiv Detail & Related papers (2022-06-14T12:29:08Z) - OPERA:Operation-Pivoted Discrete Reasoning over Text [33.36388276371693]
OPERA is an operation-pivoted discrete reasoning framework for machine reading comprehension.
It uses lightweight symbolic operations as neural modules to facilitate the reasoning ability and interpretability.
Experiments on both DROP and RACENum datasets show the reasoning ability of OPERA.
arXiv Detail & Related papers (2022-04-29T15:41:47Z) - Logic Explained Networks [27.800583434727805]
We show how a mindful design of the networks leads to a family of interpretable deep learning models called Logic Explained Networks (LENs)
LENs only require their inputs to be human-understandable predicates, and they provide explanations in terms of simple First-Order Logic (FOL) formulas.
LENs may yield better classifications than established white-box models, such as decision trees and Bayesian rule lists.
arXiv Detail & Related papers (2021-08-11T10:55:42Z) - Logic-Driven Context Extension and Data Augmentation for Logical
Reasoning of Text [65.24325614642223]
We propose to understand logical symbols and expressions in the text to arrive at the answer.
Based on such logical information, we put forward a context extension framework and a data augmentation algorithm.
Our method achieves the state-of-the-art performance, and both logic-driven context extension framework and data augmentation algorithm can help improve the accuracy.
arXiv Detail & Related papers (2021-05-08T10:09:36Z) - Fixed Point Semantics for Stream Reasoning [0.0]
Stream reasoning has emerged as a research area within the AI-community with many potential applications.
The rule-based formalism em LARS for non-monotonic stream reasoning under the answer set semantics has been introduced.
We show that our semantics is sound and constructive in the sense that answer sets are derivable bottom-up and free of circular justifications.
arXiv Detail & Related papers (2020-05-17T22:25:24Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.