Tootfinder

Ecosia und Qwant starten Web-Suche über europäischen Index https://www.heise.de/news/Ecosia-und-Qwant-starten-Web-Suche-ueber-europaeischen-Index-10513424.html?wt_mc=rss.red.ho.ho.rdf.beitrag.beitrag

Knowledge-Aware Self-Correction in Language Models via Structured Memory Graphs
Swayamjit Saha
https://arxiv.org/abs/2507.04625 https://

Knowledge-Aware Self-Correction in Language Models via Structured Memory Graphs
Large Language Models (LLMs) are powerful yet prone to generating factual errors, commonly referred to as hallucinations. We present a lightweight, interpretable framework for knowledge-aware self-correction of LLM outputs using structured memory graphs based on RDF triples. Without retraining or fine-tuning, our method post-processes model outputs and corrects factual inconsistencies via external semantic memory. We demonstrate the approach using DistilGPT-2 and show promising results on simpl…

Jelly-Patch: a Fast Format for Recording Changes in RDF Datasets
Piotr Sowinski, Kacper Grzymkowski, Anastasiya Danilenka
https://arxiv.org/abs/2507.23499 https://

Jelly-Patch: a Fast Format for Recording Changes in RDF Datasets
Recording data changes in RDF systems is a crucial capability, needed to support auditing, incremental backups, database replication, and event-driven workflows. In large-scale and low-latency RDF applications, the high volume and frequency of updates can cause performance bottlenecks in the serialization and transmission of changes. To alleviate this, we propose Jelly-Patch -- a high-performance, compressed binary serialization format for changes in RDF datasets. To evaluate its performance, w…

EVOKS (Editor for Vocabularies to Know Semantics) "allows you to:
- create a #SKOS vocabulary from scratch
- import SKOS vocabularies in RDF/XML or Turtle format
- edit SKOS vocabularies without using its textual representation
- work collaborativley
- publish the vocabulary with a single click in the vocabulary browser

The Rate-Distortion Function for Sampled Cyclostationary Gaussian Processes with Memory and with Bounded Processing Delay: Extended Version with Proofs
Zikun Tan, Ron Dabora, H. Vincent Poor
https://arxiv.org/abs/2507.00656

The Rate-Distortion Function for Sampled Cyclostationary Gaussian Processes with Memory and with Bounded Processing Delay: Extended Version with Proofs
We study the rate-distortion function (RDF) for the lossy compression of discrete-time (DT) wide-sense almost cyclostationary (WSACS) Gaussian processes with memory, arising from sampling continuous-time (CT) wide-sense cyclostationary (WSCS) Gaussian source processes. The importance of this problem arises as such CT processes represent communications signals, and sampling must be applied to facilitate the DT processing associated with their compression. Moreover, the physical characteristics o…

LOL, what?! Germany is now having its own 'Veterans Day'?! 🤦‍♀️
https://www.dw.com/es/alemania-celebra-el-primer-día-de-los-veteranos/a-72890966?maca=spa-rss-sp-inter-1008-rdf

The KG-ER Conceptual Schema Language
Enrico Franconi, Beno\^it Groz, Jan Hidders, Nina Pardal, S{\l}awek Staworko, Jan Van den Bussche, Piotr Wieczorek
https://arxiv.org/abs/2508.02548

The KG-ER Conceptual Schema Language
We propose KG-ER, a conceptual schema language for knowledge graphs that describes the structure of knowledge graphs independently of their representation (relational databases, property graphs, RDF) while helping to capture the semantics of the information stored in a knowledge graph.

DBLPLink 2.0 -- An Entity Linker for the DBLP Scholarly Knowledge Graph
Debayan Banerjee, Tilahun Abedissa Taffa, Ricardo Usbeck
https://arxiv.org/abs/2507.22811 https://…

DBLPLink 2.0 -- An Entity Linker for the DBLP Scholarly Knowledge Graph
In this work we present an entity linker for DBLP's 2025 version of RDF-based Knowledge Graph. Compared to the 2022 version, DBLP now considers publication venues as a new entity type called dblp:Stream. In the earlier version of DBLPLink, we trained KG-embeddings and re-rankers on a dataset to produce entity linkings. In contrast, in this work, we develop a zero-shot entity linker using LLMs using a novel method, where we re-rank candidate entities based on the log-probabilities of the "yes" t…

Jelly: a fast and convenient RDF serialization format
Piotr Sowinski, Karolina Bogacka, Anastasiya Danilenka, Nikita Kozlov
https://arxiv.org/abs/2506.11298

Jelly: a fast and convenient RDF serialization format
Existing RDF serialization formats such as Turtle, N-Triples, and JSON-LD are widely used for communication and storage in knowledge graph and Semantic Web applications. However, they suffer from limitations in performance, compression ratio, and lack of native support for RDF streams. To address these shortcomings, we introduce Jelly, a fast and convenient binary serialization format for RDF data that supports both batch and streaming use cases. Jelly is designed to maximize serialization thro…

SHACL Validation in the Presence of Ontologies: Semantics and Rewriting Techniques
Anouk Oudshoorn, Magdalena Ortiz, Mantas Simkus
https://arxiv.org/abs/2507.12286

SHACL Validation in the Presence of Ontologies: Semantics and Rewriting Techniques
SHACL and OWL are two prominent W3C standards for managing RDF data. These languages share many features, but they have one fundamental difference: OWL, designed for inferring facts from incomplete data, makes the open-world assumption, whereas SHACL is a constraint language that treats the data as complete and must be validated under the closed-world assumption. The combination of both formalisms is very appealing and has been called for, but their semantic gap is a major challenge, semantical…

Condensed Representation of RDF and its Application on Graph Versioning
Jey Puget Gil, Emmanuel Coquery, John Samuel, Gilles Gesquiere
https://arxiv.org/abs/2506.21203

Condensed Representation of RDF and its Application on Graph Versioning
The study of the evolving phenomena in a domain helps to understand the relationships between entities at different points in time and predict future trends. These phenomena, often complex, can be represented using knowledge graphs, which have the capability to model heterogeneous data from multiple sources. Nowadays, a considerable amount of sources delivering periodic updates to knowledge graphs in various domains is openly available. The evolution of data is of interest to knowledge graph ma…

Replaced article(s) found for cs.DB. https://arxiv.org/list/cs.DB/new
[1/1]:
- Jelly: a Fast and Convenient RDF Serialization Format
Piotr Sowinski, Karolina Bogacka, Anastasiya Danilenka, Nikita Kozlov

xpSHACL: Explainable SHACL Validation using Retrieval-Augmented Generation and Large Language Models
Gustavo Correa Publio, Jos\'e Emilio Labra Gayo
https://arxiv.org/abs/2507.08432

xpSHACL: Explainable SHACL Validation using Retrieval-Augmented Generation and Large Language Models
Shapes Constraint Language (SHACL) is a powerful language for validating RDF data. Given the recent industry attention to Knowledge Graphs (KGs), more users need to validate linked data properly. However, traditional SHACL validation engines often provide terse reports in English that are difficult for non-technical users to interpret and act upon. This paper presents xpSHACL, an explainable SHACL validation system that addresses this issue by combining rule-based justification trees with retri…