# RDF (Resource Description Framework)

RDF (Resource Description Framework) is a standard model for data interchange on the web, using URIs to name the relationships between things and a directed, labeled graph to represent the data.

This is one page of public article previews, not the complete archive. Follow Next page to continue. Summaries are not the original full articles.

## Similarity-based OSF Logic for Flexible SPARQL Query Answering

DevFeed: [Similarity-based OSF Logic for Flexible SPARQL Query Answering](<https://devfeed.tech/articles/similarity-based-osf-logic-for-flexible-sparql-query-answering-145646.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.26261>)

Author: Gian Carlo Milanese, Gabriella Pasi

Published: 2026-11-20T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>), [arXiv: Databases](<https://devfeed.tech/sources/arxiv-databases.md>)

Topics: [RDF (Resource Description Framework)](<https://devfeed.tech/topics/rdf.md>), [Wikidata](<https://devfeed.tech/topics/wikidata.md>)

Tags: [algorithm](<https://devfeed.tech/tags/algorithm.md>), [calculus](<https://devfeed.tech/tags/calculus.md>), [constraint](<https://devfeed.tech/tags/constraint.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-db](<https://devfeed.tech/tags/cs-db.md>), [cs-lo](<https://devfeed.tech/tags/cs-lo.md>), [domain](<https://devfeed.tech/tags/domain.md>), [engine](<https://devfeed.tech/tags/engine.md>), [feature](<https://devfeed.tech/tags/feature.md>), [flexible](<https://devfeed.tech/tags/flexible.md>), [functions](<https://devfeed.tech/tags/functions.md>), [graphs](<https://devfeed.tech/tags/graphs.md>), [knowledge](<https://devfeed.tech/tags/knowledge.md>), [knowledge-graphs](<https://devfeed.tech/tags/knowledge-graphs.md>), [language](<https://devfeed.tech/tags/language.md>), [logic](<https://devfeed.tech/tags/logic.md>), [ontology](<https://devfeed.tech/tags/ontology.md>), [query](<https://devfeed.tech/tags/query.md>), [rdf](<https://devfeed.tech/tags/rdf.md>), [reasoning](<https://devfeed.tech/tags/reasoning.md>), [results](<https://devfeed.tech/tags/results.md>), [returning](<https://devfeed.tech/tags/returning.md>), [similarity](<https://devfeed.tech/tags/similarity.md>)

### AI overview

The updated fosf reasoner adds similarity-based flexible SPARQL answering over RDF knowledge graphs. Queries are written as fuzzy OSF terms, then rewritten using sort definitions, feature domain and range declarations, and fuzzy subsumption and similarity relations before translation into standard SPARQL. Constraint normalization allows approximate answers when a query would otherwise conflict with the ontology. The source describes the approach and its components but provides no evaluation results or performance comparisons.

### Source excerpt

arXiv:2611.26261v1 Announce Type: new Abstract: We present an updated version of fosf, a reasoner for fuzzy order-sorted feature (OSF) logic, with support for flexible SPARQL query answering over RDF knowledge graphs. Fuzzy OSF logic is a knowledge representation and reasoning language where feature symbols denote functions and sort symbols denote fuzzy sets. Sorts are organized in a fuzzy subsumption relation that extends to OSF terms, record-like structures representing classes of entities. The unification algorithm for these structures provides a calculus of fuzzy type subsumption. The latest release of fosf introduces support for similarity-based reasoning by extending the OSF language with a similarity relation among sorts, alongside a translation engine for compiling OSF terms into standard SPARQL. Queries expressed as OSF terms undergo fuzzy ontology-aware rewriting prior to translation. This process incorporates an OSF theory of sort definitions, feature domain and range declarations, and fuzzy subsumption and similarity relations through fuzzy OSF constraint normalization. This rewriting enables flexible query answering by returning approximate solutions, allowing queries that would otherwise be inconsistent with the underlying ontology to yield relevant results.

## Seven Spheres Became an App: Here's How

DevFeed: [Seven Spheres Became an App: Here's How](<https://devfeed.tech/articles/seven-spheres-became-an-app-here-s-how-144633.md>)

Original publisher: [Read original article](<https://hackernoon.com/seven-spheres-became-an-app-heres-how?source=rss>)

Author: sammii

Published: 2026-11-19T22:30:31Z

Content type: article

Language: en

Sources: [HackerNoon](<https://devfeed.tech/sources/hackernoon.md>)

Topics: [UI/UX Design](<https://devfeed.tech/topics/ui-ux-design.md>), [AI interaction best practices](<https://devfeed.tech/topics/ai-interaction-best-practices.md>), [RDF (Resource Description Framework)](<https://devfeed.tech/topics/rdf.md>)

Tags: [2017](<https://devfeed.tech/tags/2017.md>), [22](<https://devfeed.tech/tags/22.md>), [a-journey-through-light](<https://devfeed.tech/tags/a-journey-through-light.md>), [about](<https://devfeed.tech/tags/about.md>), [academic](<https://devfeed.tech/tags/academic.md>), [account](<https://devfeed.tech/tags/account.md>), [after](<https://devfeed.tech/tags/after.md>), [ai](<https://devfeed.tech/tags/ai.md>), [all](<https://devfeed.tech/tags/all.md>), [am](<https://devfeed.tech/tags/am.md>), [analytics](<https://devfeed.tech/tags/analytics.md>), [app](<https://devfeed.tech/tags/app.md>), [app-development](<https://devfeed.tech/tags/app-development.md>), [application](<https://devfeed.tech/tags/application.md>), [apps](<https://devfeed.tech/tags/apps.md>), [architecture](<https://devfeed.tech/tags/architecture.md>), [here](<https://devfeed.tech/tags/here.md>), [here-s](<https://devfeed.tech/tags/here-s.md>), [i](<https://devfeed.tech/tags/i.md>), [javascript](<https://devfeed.tech/tags/javascript.md>), [lunary](<https://devfeed.tech/tags/lunary.md>), [ma-research](<https://devfeed.tech/tags/ma-research.md>), [my](<https://devfeed.tech/tags/my.md>), [open-source-project](<https://devfeed.tech/tags/open-source-project.md>), [platform](<https://devfeed.tech/tags/platform.md>), [software-development](<https://devfeed.tech/tags/software-development.md>)

### AI overview

The author presents Lunary as a software continuation of their MA research into Hermetic cosmology: it makes planetary correspondences visible by structuring them as a chart, transit engine, reference library, and AI guide. The chart uses astronomy-engine, described as an open-source VSOP87 JavaScript implementation, and is available without a subscription. The transit engine calculates 36 aspect types across classical and modern bodies; the software handles the arithmetic while users interpret it. The roughly 2,000-entry grimoire organizes traditional correspondences as a queryable knowledge graph. The astral guide retrieves material from that library and the user's chart context, with the author saying it does not generate astrology or predictions. Lunary is framed as a philosophical reference built around mapping and interpretation, distinct from horoscope products that market certainty.

### Source excerpt

How the Hermetic cosmology I researched for my MA became the astrology platform I've spent the last two years on.

## ProvCards: Artifact-Oriented Provenance for Heterogeneous Scientific Workflows

DevFeed: [ProvCards: Artifact-Oriented Provenance for Heterogeneous Scientific Workflows](<https://devfeed.tech/articles/provcards-artifact-oriented-provenance-for-heterogeneous-scientific-workflows-142291.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.24894>)

Author: Tanja Auge, Marinus Holitschke, Meike Klettke

Published: 2026-11-19T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Databases](<https://devfeed.tech/sources/arxiv-databases.md>)

Topics: [reproducibility](<https://devfeed.tech/topics/reproducibility.md>), [Data pipelines](<https://devfeed.tech/topics/data-pipelines.md>), [RDF (Resource Description Framework)](<https://devfeed.tech/topics/rdf.md>)

Tags: [cs-db](<https://devfeed.tech/tags/cs-db.md>), [data-processing](<https://devfeed.tech/tags/data-processing.md>), [provenance](<https://devfeed.tech/tags/provenance.md>), [querying](<https://devfeed.tech/tags/querying.md>), [reproducibility](<https://devfeed.tech/tags/reproducibility.md>), [workflows](<https://devfeed.tech/tags/workflows.md>)

### AI overview

ProvCards captures workflow provenance as portable artifacts grounded in the W3C PROV Data Model. Components can independently create, exchange, reuse, and compose cards without relying on a particular workflow system or centralized execution context. ProvDecks group related cards while preserving their identities; derived ProvGraphs support reconstruction, querying, visualization, and analysis. A graph-based implementation evaluated in a scientific data-processing workflow demonstrated component-level capture, cross-component composition, and reconstruction. The evidence is limited to the abstract and does not specify comparative performance or broader evaluation results.

### Source excerpt

arXiv:2611.24894v1 Announce Type: new Abstract: Reproducibility in scientific workflows is hindered by heterogeneous components and execution environments, as well as fragmented provenance capture. Although existing approaches offer established semantics and workflow-specific solutions, provenance remains difficult to capture, exchange, and compose across workflow boundaries. We present ProvCards, an artifact-oriented approach that treats provenance as a first-class artifact grounded in the W3C PROV Data Model. Individual workflow components can generate cards that are stored, exchanged, reused, and composed independently of any workflow system or centralized execution context. ProvDecks group related cards into portable scopes while preserving their identities. ProvGraphs provide derived views for provenance reconstruction, querying, visualization, and analysis. Together, these representations support coherent, task-specific provenance views across heterogeneous components, facilitating traceability, reuse, and reproducibility. We implement ProvCards using a graph-based infrastructure and evaluate them in a scientific data-processing workflow. The results demonstrate independent provenance capture at the component level, composition across component boundaries, and reconstruction for querying and analysis. ProvCards provide a portable, composable, and incrementally extensible foundation for provenance management in heterogeneous scientific workflows.

## Samyama: A Unified Graph-Vector Database with In-Database Optimization, Agentic Enrichment, and Hardware Acceleration

DevFeed: [Samyama: A Unified Graph-Vector Database with In-Database Optimization, Agentic Enrichment, and Hardware Acceleration](<https://devfeed.tech/articles/samyama-a-unified-graph-vector-database-with-in-database-optimization-agentic-enrichment-and-hardware-acceleration-135433.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2603.08036>)

Author: Madhulatha Mandarapu, Sandeep Kunkunuru

Published: 2026-11-16T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Databases](<https://devfeed.tech/sources/arxiv-databases.md>)

Topics: [graph-database](<https://devfeed.tech/topics/graph-database.md>), [Vectors & LLMs](<https://devfeed.tech/topics/vectors-llms.md>), [database-optimization](<https://devfeed.tech/topics/database-optimization.md>), [RDF (Resource Description Framework)](<https://devfeed.tech/topics/rdf.md>), [Agentic AI](<https://devfeed.tech/topics/what-is-agentic-ai.md>), [RAPIDS](<https://devfeed.tech/topics/rapids.md>)

Tags: [22](<https://devfeed.tech/tags/22.md>), [acceleration](<https://devfeed.tech/tags/acceleration.md>), [agentic](<https://devfeed.tech/tags/agentic.md>), [analytics](<https://devfeed.tech/tags/analytics.md>), [arxiv](<https://devfeed.tech/tags/arxiv.md>), [cloud](<https://devfeed.tech/tags/cloud.md>), [cpu](<https://devfeed.tech/tags/cpu.md>), [cs-db](<https://devfeed.tech/tags/cs-db.md>), [cuda](<https://devfeed.tech/tags/cuda.md>), [cypher](<https://devfeed.tech/tags/cypher.md>), [database](<https://devfeed.tech/tags/database.md>), [database-optimization](<https://devfeed.tech/tags/database-optimization.md>), [databases](<https://devfeed.tech/tags/databases.md>), [edge](<https://devfeed.tech/tags/edge.md>), [enrichment](<https://devfeed.tech/tags/enrichment.md>), [graph](<https://devfeed.tech/tags/graph.md>), [hardware](<https://devfeed.tech/tags/hardware.md>), [hardware-acceleration](<https://devfeed.tech/tags/hardware-acceleration.md>), [optimization](<https://devfeed.tech/tags/optimization.md>), [vector](<https://devfeed.tech/tags/vector.md>), [vector-database](<https://devfeed.tech/tags/vector-database.md>)

### AI overview

Samyama combines graph and vector storage, analytics, RDF/SPARQL, 22 query-callable metaheuristic solvers, and LLM-based graph enrichment in a Rust engine. At v1.8.0, tests on rented Linux hosts report 123K-152K nodes/s ingestion and PageRank iterations of 6.7 ms at 10,000 nodes and 236 ms at one million on a 16-vCPU instance. On an NVIDIA A16, CUDA matches CPU performance at 10,000 nodes and reaches 1.62x and 2.70x at 100,000 and one million, respectively, with 1.1-1.35 seconds of first-call context initialization. The abstract withdraws earlier GPU, Cypher-throughput, index-scaling, and vector-search figures as unreproducible. It reports 99.9% of evaluated openCypher TCK scenarios passing; in a same-host comparison with Neo4j 5 and FalkorDB, all 14 complex reads were within 5x of the best competitor and 7 were faster.

### Source excerpt

arXiv:2603.08036v4 Announce Type: replace Abstract: Modern data architectures fragment across graph databases, vector stores, analytics engines and optimization solvers, forcing ETL between them. We present Samyama, a graph-vector database in Rust that unifies these workloads in one engine: a RocksDB-backed store with MVCC, a vectorized executor, a cost-based planner, a CSR analytics engine, RDF and SPARQL, 22 metaheuristic solvers callable from the query language, HNSW vector indexing, and agentic enrichment that expands a graph via LLMs. It has been run to billion-edge scale: 74.3M nodes and 1.07B edges from four biomedical sources on one machine for $2.50 of spot compute. This version re-measures the system at release v1.8.0 on rented Linux hosts a reader can boot, replacing earlier figures taken on a Mac Mini that nobody could re-run. On a 16-vCPU cloud instance, ingestion reaches 123K-152K nodes/s and PageRank costs 6.7 ms per iteration at ten thousand nodes and 236 ms at a million. The previously reported 8.2x GPU speedup is withdrawn; in its place we measure the CUDA path, which no earlier version measured at all, on a rented NVIDIA A16: parity with the CPU at ten thousand nodes, 1.62x at a hundred thousand and 2.70x at a million, with 1.1-1.35 s of context initialisation on the first call. The earlier Cypher-throughput figure, its claim of near-constant index-driven scaling, and a vector-search figure are withdrawn as unreproducible. openCypher conformance, once estimated at ~90%, is now measured at 99.9% of evaluated TCK scenarios. Against Neo4j 5 and FalkorDB on one host over an identical SF10 extract, 14 of 14 SNB complex reads land within 5x of the best competitor and 7 of 14 are faster.

## MMCOMET: A Large-Scale Multimodal Commonsense Knowledge Graph for Visual Reasoning

DevFeed: [MMCOMET: A Large-Scale Multimodal Commonsense Knowledge Graph for Visual Reasoning](<https://devfeed.tech/articles/mmcomet-a-large-scale-multimodal-commonsense-knowledge-graph-for-visual-reasoning-128090.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2603.01055>)

Author: Jinwoo Kim, Rina Carines Cabral, Dhita Putri Pratama, Eileen Wang, Hiba Arnaout, Shuo Yang, Danyang Liu, Seungyeon Ji, Jie Yang, Josiah Poon, Jeff Z. Pan, Kyungreem Han, Soyeon Caren Han

Published: 2026-11-11T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>)

Topics: [Artificial Intelligence](<https://devfeed.tech/topics/ai.md>), [Image](<https://devfeed.tech/topics/image.md>), [RDF (Resource Description Framework)](<https://devfeed.tech/topics/rdf.md>), [Large Language Model](<https://devfeed.tech/topics/llm.md>)

Tags: [adaptive](<https://devfeed.tech/tags/adaptive.md>), [alignment](<https://devfeed.tech/tags/alignment.md>), [benchmark](<https://devfeed.tech/tags/benchmark.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [evaluation](<https://devfeed.tech/tags/evaluation.md>), [framework](<https://devfeed.tech/tags/framework.md>), [graph](<https://devfeed.tech/tags/graph.md>), [grounding](<https://devfeed.tech/tags/grounding.md>), [hybrid](<https://devfeed.tech/tags/hybrid.md>), [image](<https://devfeed.tech/tags/image.md>), [image-editing](<https://devfeed.tech/tags/image-editing.md>), [integration](<https://devfeed.tech/tags/integration.md>), [knowledge](<https://devfeed.tech/tags/knowledge.md>), [knowledge-graph](<https://devfeed.tech/tags/knowledge-graph.md>), [knowledge-graphs](<https://devfeed.tech/tags/knowledge-graphs.md>), [large](<https://devfeed.tech/tags/large.md>), [llm](<https://devfeed.tech/tags/llm.md>), [multimodal](<https://devfeed.tech/tags/multimodal.md>), [noise](<https://devfeed.tech/tags/noise.md>), [pipeline](<https://devfeed.tech/tags/pipeline.md>), [reasoning](<https://devfeed.tech/tags/reasoning.md>)

### AI overview

MMCOMET extends ATOMIC2020 by linking commonsense triples to representative images through a hybrid alignment pipeline, producing over 900K multimodal tuples across 19 relation types. Its evaluation spans visual commonsense reasoning, visual question answering, storytelling, image editing, and captioning. The authors report that visual grounding yields more contextually aligned knowledge than text-only knowledge graphs or LLM-generated knowledge, particularly for reasoning-intensive tasks. External knowledge is task-dependent: naive integration can add noise in perception-dominated settings. An adaptive knowledge router addresses this by selecting knowledge paths or bypassing knowledge when it may be harmful.

### Source excerpt

arXiv:2603.01055v3 Announce Type: replace Abstract: Commonsense knowledge is widely used to support multimodal reasoning and generation, yet existing resources are predominantly text-only and lack grounding in visual context. This limitation often leads to the retrieval of semantically related but visually misaligned knowledge, and can degrade downstream performance. We introduce MMCOMET, a large-scale multimodal commonsense knowledge graph that integrates physical, social, and eventive knowledge with visual grounding. MMCOMET extends ATOMIC2020 by associating each commonsense triple with representative images through a hybrid alignment pipeline, resulting in over 900K multimodal tuples spanning 19 relation types. We further establish a unified evaluation framework across diverse vision-language tasks, including visual commonsense reasoning, visual question answering, visual storytelling, image editing, and image captioning. Our analysis shows that multimodal grounding provides more contextually aligned and reliable knowledge compared to both text-only knowledge graphs and LLM-based knowledge generation, particularly in reasoning-intensive scenarios. At the same time, we observe that the effectiveness of external knowledge is task-dependent, and naive knowledge integration can introduce noise in perception-dominated settings. To mitigate this, we propose an adaptive knowledge router that dynamically selects optimal paths or bypass knowledge in harmful settings. MMCOMET provides a scalable multimodal commonsense resource and a benchmark for studying the role of grounded knowledge in multimodal systems.

## The Neo4j Ontology Graph Specification: A pragmatic, open, AI-first approach

DevFeed: [The Neo4j Ontology Graph Specification: A pragmatic, open, AI-first approach](<https://devfeed.tech/articles/the-neo4j-ontology-graph-specification-a-pragmatic-open-ai-first-approach-119746.md>)

Original publisher: [Read original article](<https://neo4j.com/blog/developer/the-neo4j-ontology-graph-specification-a-pragmatic-open-ai-first-approach/>)

Author: john stegeman

Published: 2026-11-05T19:57:17Z

Content type: release

Language: en

Sources: [Neo4j](<https://devfeed.tech/sources/graph-database-technology-neo4j-blog.md>)

Topics: [Neo4j](<https://devfeed.tech/topics/neo4j.md>), [schema design](<https://devfeed.tech/topics/schema-design.md>), [Open Source](<https://devfeed.tech/topics/open-source.md>), [RDF (Resource Description Framework)](<https://devfeed.tech/topics/rdf.md>)

Tags: [agentic-ai](<https://devfeed.tech/tags/agentic-ai.md>), [agents](<https://devfeed.tech/tags/agents.md>), [ai](<https://devfeed.tech/tags/ai.md>), [ai-agents](<https://devfeed.tech/tags/ai-agents.md>), [ai-native](<https://devfeed.tech/tags/ai-native.md>), [ai-systems](<https://devfeed.tech/tags/ai-systems.md>), [applications](<https://devfeed.tech/tags/applications.md>), [automation](<https://devfeed.tech/tags/automation.md>), [data](<https://devfeed.tech/tags/data.md>), [developer](<https://devfeed.tech/tags/developer.md>), [domain](<https://devfeed.tech/tags/domain.md>), [graph](<https://devfeed.tech/tags/graph.md>), [graph-database](<https://devfeed.tech/tags/graph-database.md>), [interoperability](<https://devfeed.tech/tags/interoperability.md>), [knowledge](<https://devfeed.tech/tags/knowledge.md>), [knowledge-graph](<https://devfeed.tech/tags/knowledge-graph.md>), [neo4j](<https://devfeed.tech/tags/neo4j.md>), [ontologies](<https://devfeed.tech/tags/ontologies.md>), [ontology](<https://devfeed.tech/tags/ontology.md>), [open](<https://devfeed.tech/tags/open.md>), [open-source](<https://devfeed.tech/tags/open-source.md>), [source](<https://devfeed.tech/tags/source.md>), [specification](<https://devfeed.tech/tags/specification.md>), [systems](<https://devfeed.tech/tags/systems.md>)

### AI overview

The Neo4j Ontology Graph Specification is an open-source, versioned JSON or YAML format for expressing graph domain knowledge so databases, applications, and AI agents can use a shared model. It captures nodes, relationships, Neo4j properties, cardinality, constraints, references to external definitions, and named extensions for indexes and data-source mappings. Descriptions, aliases, and implied labels add context beyond a schema's structural labels. The same ontology can support database constraints, data enrichment, and application or agent interpretation. Published JSON Schema enables structural validation, while built-in validators check Neo4j creation and data-source mappings; JVM, JavaScript/TypeScript, and Go SDKs are available. The specification documents mappings to selected RDFS and SHACL constructs and links elements to external terms, but does not define an RDF-based serialization. The excerpt presents it as a complementary graph-oriented format for broader application and AI uses.

### Source excerpt

We're announcing the Neo4j Ontology Graph Specification, an open-source specification for representing domain knowledge in a machine-readable form that enables interoperability and automation across data, applications, and AI systems. Ontologies are critical components of AI systems and enterprise applications, and... Read more ->

## JediKG: Return of the Schema

DevFeed: [JediKG: Return of the Schema](<https://devfeed.tech/articles/jedikg-return-of-the-schema-116668.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2602.14795>)

Author: Ivan Diliso, Roberto Barile, Nicola Fanizzi, Claudia d'Amato

Published: 2026-11-04T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>), [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Dataset development](<https://devfeed.tech/topics/dataset-development.md>), [RDF (Resource Description Framework)](<https://devfeed.tech/topics/rdf.md>), [Machine learning](<https://devfeed.tech/topics/machine-learning.md>), [schema design](<https://devfeed.tech/topics/schema-design.md>), [Artificial Intelligence](<https://devfeed.tech/topics/ai.md>)

Tags: [benchmark](<https://devfeed.tech/tags/benchmark.md>), [completeness](<https://devfeed.tech/tags/completeness.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [data](<https://devfeed.tech/tags/data.md>), [data-driven](<https://devfeed.tech/tags/data-driven.md>), [datasets](<https://devfeed.tech/tags/datasets.md>), [dimensions](<https://devfeed.tech/tags/dimensions.md>), [domain](<https://devfeed.tech/tags/domain.md>), [evaluation](<https://devfeed.tech/tags/evaluation.md>), [experimental](<https://devfeed.tech/tags/experimental.md>), [first](<https://devfeed.tech/tags/first.md>), [full](<https://devfeed.tech/tags/full.md>), [general](<https://devfeed.tech/tags/general.md>), [graph](<https://devfeed.tech/tags/graph.md>), [integration](<https://devfeed.tech/tags/integration.md>), [knowledge](<https://devfeed.tech/tags/knowledge.md>), [knowledge-graph](<https://devfeed.tech/tags/knowledge-graph.md>), [learning](<https://devfeed.tech/tags/learning.md>), [libraries](<https://devfeed.tech/tags/libraries.md>), [machine-learning](<https://devfeed.tech/tags/machine-learning.md>), [schema](<https://devfeed.tech/tags/schema.md>)

### AI overview

JEDIKG addresses the loss of schema information in knowledge graph refinement benchmarks with two components: JDEX, a configurable tool for extracting modular datasets from RDF/OWL graphs, and JDSET, a curated suite of eleven datasets spanning different levels of expressivity, volume, and domain. JDEX preserves schema expressivity, uses OWL reasoning to detect and correct inconsistencies and materialize implicit knowledge, and offers integration utilities for PyTorch and PyKEEN. The abstract reports validation of dataset completeness and portability and preliminary use in workflows combining data-driven methods with schema-driven reasoning.

### Source excerpt

arXiv:2602.14795v2 Announce Type: replace-cross Abstract: Benchmark datasets for Knowledge Graph Refinement typically contain only ground facts, discarding the schema available in the source knowledge graph. This limits the evaluation of Neural-Symbolic methods that leverage expressive schemas. We present JEDIKG the first resource that systematically addresses these gaps through two components: JDEX a general configurable tool for extracting complete, portable, modular dataset from any RDF/OWL knowledge graph; and JDSET, a curated suite of eleven datasets with varying expressivity, volume, and domain. JDEX preserves full schema expressivity, employs standard OWL reasoning to detect and correct inconsistencies and materialize implicit knowledge, applies schema modularization, and provides utilities for integration with mainstream machine learning libraries such as PyTorch and PyKEEN. We validated the completeness and portability of the datasets across several dimensions and preliminarily proved the utility of JEDIKG in experimental workflows combining data-driven methods with schema-driven reasoning.

## SPARQLcirc: Probabilistic Query Evaluation with Provenance Circuits

DevFeed: [SPARQLcirc: Probabilistic Query Evaluation with Provenance Circuits](<https://devfeed.tech/articles/sparqlcirc-probabilistic-query-evaluation-with-provenance-circuits-113640.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.00128>)

Author: Jingcheng Wu, Ratan Bahadur Thapa, Daniel Hern\\'andez, Steffen Staab

Published: 2026-11-03T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>), [arXiv: Databases](<https://devfeed.tech/sources/arxiv-databases.md>)

Topics: [RDF (Resource Description Framework)](<https://devfeed.tech/topics/rdf.md>), [Wikidata](<https://devfeed.tech/topics/wikidata.md>)

Tags: [circuits](<https://devfeed.tech/tags/circuits.md>), [compilation](<https://devfeed.tech/tags/compilation.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-db](<https://devfeed.tech/tags/cs-db.md>), [databases](<https://devfeed.tech/tags/databases.md>), [evaluation](<https://devfeed.tech/tags/evaluation.md>), [knowledge-graph](<https://devfeed.tech/tags/knowledge-graph.md>), [optional](<https://devfeed.tech/tags/optional.md>), [probabilistic](<https://devfeed.tech/tags/probabilistic.md>), [projection](<https://devfeed.tech/tags/projection.md>), [provenance](<https://devfeed.tech/tags/provenance.md>), [queries](<https://devfeed.tech/tags/queries.md>), [query](<https://devfeed.tech/tags/query.md>), [time](<https://devfeed.tech/tags/time.md>), [unions](<https://devfeed.tech/tags/unions.md>), [wikidata](<https://devfeed.tech/tags/wikidata.md>)

### AI overview

SPARQLcirc computes exact answer probabilities for SPARQL queries over tuple-independent probabilistic knowledge graphs by compiling Boolean provenance into a shared circuit and applying weighted model counting. It rewrites queries into CONSTRUCT queries that name gates by content, allowing independently obtained results to form one circuit. The rewriting covers joins, unions, projection, filters, OPTIONAL, difference, and transitive closures. The evaluation used randomly assigned probabilities on WatDiv, gMark, and Wikidata data, with CONSTRUCT queries run on GraphDB, Fuseki, and Oxigraph. Compared with compiling provenance expressions from the NPCS SPARQL provenance rewriting, SPARQLcirc's end-to-end time ratio decreased as the number of derivations increased. The abstract does not provide absolute timings or quantify the gains.

### Source excerpt

arXiv:2611.00128v1 Announce Type: new Abstract: Probabilistic query evaluation (PQE) computes the probability of every answer of a query over a tuple-independent probabilistic knowledge graph. We study exact PQE for SPARQL over graphs accessed through SPARQL 1.1 endpoints. Shared triples among the derivations of an answer make exact PQE #P-hard in general. Knowledge compilation of the Boolean provenance of every answer yields exact probabilities, and the provenance formulas of different answers can share subformulas. We propose SPARQLcirc, which rewrites a SPARQL query into CONSTRUCT queries that name every gate by its content, so that the results of independent queries form one Boolean provenance circuit for all answers. The rewriting covers joins, unions, projection, filters, OPTIONAL, difference, and transitive closures. SPARQLcirc compiles the circuit and computes the exact probability of every answer by weighted model counting. For the evaluation, we draw random probabilities for the triples of WatDiv and gMark and the statements of Wikidata and evaluate the CONSTRUCT queries on GraphDB, Fuseki, and Oxigraph. The ratio of the end-to-end time of PQE with SPARQLcirc to that of PQE by compiling the provenance expressions of the SPARQL provenance rewriting NPCS decreases with the number of derivations.

## OntoDoc: Automatically Generating Ontology Resource Descriptions

DevFeed: [OntoDoc: Automatically Generating Ontology Resource Descriptions](<https://devfeed.tech/articles/ontodoc-automatically-generating-ontology-resource-descriptions-115147.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.01276>)

Author: Juan Guajardo Gutierrez, Mike Tran, Nasim Shirvani Mahdavi, Chengkai Li

Published: 2026-11-03T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>)

Topics: [Artificial Intelligence](<https://devfeed.tech/topics/ai.md>), [RDF (Resource Description Framework)](<https://devfeed.tech/topics/rdf.md>), [Large Language Model](<https://devfeed.tech/topics/llm.md>), [Language Engineering](<https://devfeed.tech/topics/language-engineering.md>)

Tags: [agent-framework](<https://devfeed.tech/tags/agent-framework.md>), [all](<https://devfeed.tech/tags/all.md>), [arxiv](<https://devfeed.tech/tags/arxiv.md>), [biomedical](<https://devfeed.tech/tags/biomedical.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-ir](<https://devfeed.tech/tags/cs-ir.md>), [database](<https://devfeed.tech/tags/database.md>), [evaluation](<https://devfeed.tech/tags/evaluation.md>), [framework](<https://devfeed.tech/tags/framework.md>), [intermediate](<https://devfeed.tech/tags/intermediate.md>), [knowledge-graph](<https://devfeed.tech/tags/knowledge-graph.md>), [knowledge-graphs](<https://devfeed.tech/tags/knowledge-graphs.md>), [large-language-models-llms](<https://devfeed.tech/tags/large-language-models-llms.md>), [llms](<https://devfeed.tech/tags/llms.md>), [multi-agent](<https://devfeed.tech/tags/multi-agent.md>), [natural-language](<https://devfeed.tech/tags/natural-language.md>), [ontology](<https://devfeed.tech/tags/ontology.md>), [open-web](<https://devfeed.tech/tags/open-web.md>), [pipeline](<https://devfeed.tech/tags/pipeline.md>), [structured](<https://devfeed.tech/tags/structured.md>), [web](<https://devfeed.tech/tags/web.md>), [wikipedia](<https://devfeed.tech/tags/wikipedia.md>)

### AI overview

OntoDoc generates natural-language descriptions for IRIs in a SPARQL endpoint or RDF file by combining graph evidence with web context. Its four-stage pipeline explores the graph for informative triples, retrieves and re-ranks background material from Wikipedia and the open web, turns both sources into evidence-grounded assumptions, then generates a description from those assumptions. Evaluated on three biomedical, agricultural, and cross-domain knowledge graphs with LLM scoring and 11 human annotators, it matched or exceeded a naive LLM baseline and a template-based verbalizer in accuracy. It improved completeness by an average of 12% over the naive baseline and by up to 2.8 points on a five-point scale over the template-based verbalizer.

### Source excerpt

arXiv:2611.01276v1 Announce Type: new Abstract: Knowledge graphs and ontologies form the backbone of structured, machine-readable knowledge representation, yet ontology terms often lack natural language descriptions, limiting their accessibility and reuse. Existing ontology verbalization approaches tend to rely on rule-based or template-driven techniques that operate on strict, formal schema axioms, resulting in rigid verbalizations that fail to convey richer contextual semantics. We present OntoDoc, a multi-agent framework for automatically generating natural language descriptions for any Internationalized Resource Identifier (IRI) within a SPARQL endpoint or RDF file. OntoDoc operates through a four-stage pipeline: (1) a Database Context agent that adaptively explores the knowledge graph via SPARQL to collect semantically informative triples about the target IRI; (2) a Web Context agent that retrieves and re-ranks encyclopedic background knowledge from Wikipedia and the open web; (3) an Assumption Generation agent that synthesizes both contexts into a structured, evidence-grounded list of intermediate assumptions; and (4) a Description Generation agent that produces the final natural language description from the grounded assumptions. We evaluate OntoDoc on three knowledge graphs spanning biomedical, agricultural, and cross-domain settings, using both automatic scoring via Large Language Models (LLMs) and human evaluation with 11 annotators. OntoDoc consistently matches or exceeds a naive LLM baseline and a template-based ontology verbalizer in accuracy. Furthermore, it vastly outperforms both baselines in the completeness of the generated descriptions, delivering an average 12% improvement in completeness over the naive baseline across all domains, and improving completeness scores by as much as 2.8 points on a 5-point scale relative to the ontology verbalizer.

## Neuro-Symbolic Meta-Policies for Temporal Knowledge-Graph Memory under Partial Observability

DevFeed: [Neuro-Symbolic Meta-Policies for Temporal Knowledge-Graph Memory under Partial Observability](<https://devfeed.tech/articles/neuro-symbolic-meta-policies-for-temporal-knowledge-graph-memory-under-partial-observability-111908.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2607.18368>)

Author: Taewoon Kim, Vincent Fran\\c{c}ois-Lavet, Michael Cochez

Published: 2026-11-02T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>)

Topics: [RDF (Resource Description Framework)](<https://devfeed.tech/topics/rdf.md>), [Reinforcement learning](<https://devfeed.tech/topics/reinforcement-learning.md>), [Artificial Intelligence](<https://devfeed.tech/topics/ai.md>)

Tags: [adaptive](<https://devfeed.tech/tags/adaptive.md>), [annotation](<https://devfeed.tech/tags/annotation.md>), [annotations](<https://devfeed.tech/tags/annotations.md>), [controller](<https://devfeed.tech/tags/controller.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [encoding](<https://devfeed.tech/tags/encoding.md>), [exploration](<https://devfeed.tech/tags/exploration.md>), [gnn](<https://devfeed.tech/tags/gnn.md>), [graphs](<https://devfeed.tech/tags/graphs.md>), [knowledge-graph](<https://devfeed.tech/tags/knowledge-graph.md>), [memory](<https://devfeed.tech/tags/memory.md>), [memory-management](<https://devfeed.tech/tags/memory-management.md>), [neural](<https://devfeed.tech/tags/neural.md>), [observability](<https://devfeed.tech/tags/observability.md>), [policies](<https://devfeed.tech/tags/policies.md>), [policy](<https://devfeed.tech/tags/policy.md>), [rdf](<https://devfeed.tech/tags/rdf.md>), [reinforcement-learning](<https://devfeed.tech/tags/reinforcement-learning.md>), [semantic-web](<https://devfeed.tech/tags/semantic-web.md>), [semantics](<https://devfeed.tech/tags/semantics.md>), [temporal](<https://devfeed.tech/tags/temporal.md>)

### AI overview

The proposed neuro-symbolic meta-policy adapts memory management in partially observable reinforcement learning by choosing among symbolic heuristics at each decision point, while keeping execution symbolic and traceable. In RoomKG, it represents observations and hidden state as RDF graphs and adds temporal annotations to triples. Knowledge-graph encodings feed value heads for question answering, exploration, and forgetting. On train/test room splits with memory capacity 512, the qualifier-aware StarE-GNN configuration performed best on held-out data among the compared symbolic, neural, and neuro-symbolic systems; the excerpt gives no numerical results.

### Source excerpt

arXiv:2607.18368v5 Announce Type: replace Abstract: Partially observable reinforcement learning requires deciding what to retain, retrieve, and forget over time. We introduce a neuro-symbolic meta-policy that learns which symbolic memory heuristic to apply at each decision point while keeping execution symbolic. Our setting uses temporal knowledge-graph memory in RoomKG, where hidden state and observations are represented as Resource Description Framework (RDF) graphs and memory is augmented with temporal RDF triple annotations. The model combines knowledge-graph encoding of memory contents with value heads for question answering, exploration, and forgetting, yielding a controller that is both adaptive and inspectable. This gives the work a direct Semantic Web grounding through RDF-based representation, annotation-compatible graph semantics, and graph-based symbolic operations over explicit memory state. On train/test room splits at long-term memory capacity of 512, the qualifier-aware StarE-GNN configuration achieves the best held-out performance among the compared symbolic, neural, and neuro-symbolic systems while preserving step-level traceability of memory-management decisions.

## GraphRAGProv: GraphRAG Meets How-Provenance

DevFeed: [GraphRAGProv: GraphRAG Meets How-Provenance](<https://devfeed.tech/articles/graphragprov-graphrag-meets-how-provenance-103248.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2610.37237>)

Author: Wadie El Amrani, Luis Gal\\'arraga

Published: 2026-10-28T04:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>), [arXiv: Databases](<https://devfeed.tech/sources/arxiv-databases.md>)

Topics: [Retrieval Augmented Generation (RAG)](<https://devfeed.tech/topics/retrieval-augmented-generation-rag.md>), [RDF (Resource Description Framework)](<https://devfeed.tech/topics/rdf.md>), [Ground truth / benchmark quality](<https://devfeed.tech/topics/ground-truth-benchmark-quality.md>), [AI Chat](<https://devfeed.tech/topics/ai-chat.md>)

Tags: [announce](<https://devfeed.tech/tags/announce.md>), [architecture](<https://devfeed.tech/tags/architecture.md>), [arxiv](<https://devfeed.tech/tags/arxiv.md>), [benchmarks](<https://devfeed.tech/tags/benchmarks.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-db](<https://devfeed.tech/tags/cs-db.md>), [demo](<https://devfeed.tech/tags/demo.md>), [experimental](<https://devfeed.tech/tags/experimental.md>), [graph](<https://devfeed.tech/tags/graph.md>), [graphrag](<https://devfeed.tech/tags/graphrag.md>), [knowledge-graphs](<https://devfeed.tech/tags/knowledge-graphs.md>), [llm](<https://devfeed.tech/tags/llm.md>), [polynomials](<https://devfeed.tech/tags/polynomials.md>), [provenance](<https://devfeed.tech/tags/provenance.md>), [queries](<https://devfeed.tech/tags/queries.md>), [query](<https://devfeed.tech/tags/query.md>), [querying](<https://devfeed.tech/tags/querying.md>), [rdf](<https://devfeed.tech/tags/rdf.md>), [source](<https://devfeed.tech/tags/source.md>), [text](<https://devfeed.tech/tags/text.md>), [transformation](<https://devfeed.tech/tags/transformation.md>), [transparency](<https://devfeed.tech/tags/transparency.md>)

### AI overview

GraphRAGProv uses SPARQL over source-grounded RDF graphs to compute answers and how-provenance polynomials that show which statement occurrences were used and how they were combined. Links from each occurrence to its source text let users inspect the extracted statements and the query's reasoning, making queries a way to evaluate the text-to-graph transformation. An interactive demo across 400 cases from two multi-hop QA benchmarks found extraction and query errors even when final answers were correct.

### Source excerpt

arXiv:2610.37237v1 Announce Type: new Abstract: GraphRAG systems often use knowledge graphs to retrieve relevant context for an LLM that produces the final answer. That makes answers more inscrutable and therefore less appealing for domains where transparency is paramount. We present GraphRAGProv, an architecture that executes SPARQL queries over source-grounded RDF graphs to compute answers and their how-provenance polynomials. These polynomials record which statement occurrences were used and how they were combined. Because each occurrence is linked to its source text, users can follow these links to check whether the extracted statements reflect the text and whether the query combines them to answer the question. Querying thereby becomes a way to inspect and evaluate the text-to-graph transformation. Our interactive demo examines 400 cases from two multi-hop QA benchmarks, revealing extraction and query errors even when the final answer is correct.

## Translating RDF 1.2 Graphs to Property Graphs

DevFeed: [Translating RDF 1.2 Graphs to Property Graphs](<https://devfeed.tech/articles/translating-rdf-1-2-graphs-to-property-graphs-101505.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2610.33499>)

Author: Maxime Jakubowski, Dominik Tomaszuk, Daniel Fern\\'andez-\\'Alvarez, Ruben Taelman, Ruben Dedecker, Jose-Emilio Labra-Gayo, Katja Hose

Published: 2026-10-27T04:00:00Z

Content type: article

Language: en

Sources: [arXiv: Databases](<https://devfeed.tech/sources/arxiv-databases.md>)

Topics: [RDF (Resource Description Framework)](<https://devfeed.tech/topics/rdf.md>), [Graphs](<https://devfeed.tech/topics/graphs.md>)

Tags: [algorithms](<https://devfeed.tech/tags/algorithms.md>), [cs-db](<https://devfeed.tech/tags/cs-db.md>), [edge](<https://devfeed.tech/tags/edge.md>), [experiments](<https://devfeed.tech/tags/experiments.md>), [folding](<https://devfeed.tech/tags/folding.md>), [graph](<https://devfeed.tech/tags/graph.md>), [graphs](<https://devfeed.tech/tags/graphs.md>), [properties](<https://devfeed.tech/tags/properties.md>), [property](<https://devfeed.tech/tags/property.md>), [rdf](<https://devfeed.tech/tags/rdf.md>), [reduce](<https://devfeed.tech/tags/reduce.md>), [reification](<https://devfeed.tech/tags/reification.md>), [runtime](<https://devfeed.tech/tags/runtime.md>), [scale](<https://devfeed.tech/tags/scale.md>), [translations](<https://devfeed.tech/tags/translations.md>)

### AI overview

The paper compares three algorithms for translating RDF 1.2 graphs into labeled property graphs. Structural interprets no reification vocabulary and losslessly handles arbitrary RDF 1.2 graphs by representing triple terms as nodes. Direct interprets rdf:reifies to recover annotated edges while retaining reifiers as graph objects. Fold also moves reifier descriptions into edge properties, producing a more concise representation that can be lossy. Experiments report linear scaling for all three on tested workloads; Structural's broader coverage incurred no runtime penalty, while Fold significantly reduced edge counts on description-heavy data. The overview is based on the supplied abstract.

### Source excerpt

arXiv:2610.33499v1 Announce Type: new Abstract: RDF 1.2 introduces statement-level constructs, such as triple terms, reifiers, and descriptions, that pose new challenges for transforming RDF data into labeled property graphs (LPGs). This work presents and compares three algorithms for translating RDF 1.2 data into LPGs, each interpreting a different amount of the RDF 1.2 reification vocabulary. Algorithm Structural interprets no vocabulary and losslessly supports arbitrary RDF 1.2 graphs by representing triple terms explicitly as nodes; Direct interprets rdf:reifies to recover annotated edges while preserving reifiers as graph objects; and Fold additionally folds reifier descriptions into edge properties, resulting in a more concise, albeit lossy, LPG representation. We define the three translations, analyze which class of RDF 1.2 graphs each preserves, and experimentally evaluate their implementations. The experiments confirm the predicted trade-offs: all variants scale linearly on the tested workloads, the generality of Structural has no runtime penalty, and folding descriptions into edge records can significantly reduce the number of edges on description-heavy data.

## Every Edge Needs a Quote: Building a Quote-Grounded Knowledge Graph of Healthcare Software Adoption with Language-Model Agents

DevFeed: [Every Edge Needs a Quote: Building a Quote-Grounded Knowledge Graph of Healthcare Software Adoption with Language-Model Agents](<https://devfeed.tech/articles/every-edge-needs-a-quote-building-a-quote-grounded-knowledge-graph-of-healthcare-software-adoption-with-language-model-agents-100047.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2610.32781>)

Author: Juan Felipe Duran, Arthur Tobler, Martin Valli\\\`eres

Published: 2026-10-26T04:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>)

Topics: [Agent Harness](<https://devfeed.tech/topics/agent-harness.md>), [RDF (Resource Description Framework)](<https://devfeed.tech/topics/rdf.md>)

Tags: [adoption](<https://devfeed.tech/tags/adoption.md>), [agents](<https://devfeed.tech/tags/agents.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-cl](<https://devfeed.tech/tags/cs-cl.md>), [cs-ir](<https://devfeed.tech/tags/cs-ir.md>), [graph](<https://devfeed.tech/tags/graph.md>), [healthcare](<https://devfeed.tech/tags/healthcare.md>), [integration](<https://devfeed.tech/tags/integration.md>), [knowledge-graph](<https://devfeed.tech/tags/knowledge-graph.md>), [language-model](<https://devfeed.tech/tags/language-model.md>), [pipeline](<https://devfeed.tech/tags/pipeline.md>), [software](<https://devfeed.tech/tags/software.md>)

### AI overview

The pipeline builds a healthcare software adoption graph where every customer or integration relation must be backed by a verbatim source-page quote. It gathers pages through a deterministic vendor-site crawl and a budgeted ReAct agent searching elsewhere, then uses a permissive extractor and layered grounding: whole-page referent checks for quotes naming only one side, deterministic checks, and five model calls voting on nine criteria. Across 61 vendors, it reports 0.94 precision and 0.71 recall against a page-level key for 6,428 proposed relations; that key was drafted by one model and checked by another. Against the marketplace's curated list, performance is lower, though 89% of retained relations absent from that list are stated on a page. A vote-based confidence score reaches 0.90 precision at 0.90 recall. The authors describe bounded calls, string-matched evidence, and voting as ways to address long-context degradation and run-to-run variation.

### Source excerpt

arXiv:2610.32781v1 Announce Type: cross Abstract: Hospitals regularly buy software that clinicians and patients depend on. Because these purchases are costly, hard to reverse and can affect patient care, buyers look for evidence of which peer institutions already use a product and which systems it connects to. This evidence is public but scattered across vendor websites, press releases and third-party pages. Language-model agents can now collect it at low cost, but the correctness of the extracted claims is difficult to establish, and a wrongly listed customer can mislead buyers and misrepresent an organisation. We present a pipeline that builds a knowledge graph of customer and integration relations from the open web under one rule: every edge must be supported by a verbatim quote from its source page. Pages come from a deterministic crawl of each vendor's site and a budgeted ReAct agent that searches the rest of the web. A permissive extractor proposes relations with quotes, and a layered grounding stage decides which to keep, using a referent step that reads the whole page when a quote names only one side, deterministic checks, and a panel of five model calls voting on nine criteria. On 61 vendors, the pipeline reaches 0.94 precision and 0.71 recall against a page-level key covering the 6,428 candidate relations proposed by its extractor, whose verdicts were drafted by one model and re-checked with a second. Against the golden reference, the marketplace's own curated list, it scores lower, but 89% of the relations it keeps that the reference lacks are stated on a page. A confidence score built from the panel's votes keeps more correct relations than the fixed rule at the same precision, and reaches 0.90 precision at 0.90 recall. We also discuss how narrow, bounded model calls, string-matched evidence and voting address long-context degradation and run-to-run variance.

## Notation3: Graph Terms for RDF

DevFeed: [Notation3: Graph Terms for RDF](<https://devfeed.tech/articles/notation3-graph-terms-for-rdf-98188.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2610.31266>)

Author: D\\"orthe Arndt, Pierre-Antoine Champin

Published: 2026-10-23T04:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>)

Topics: [RDF (Resource Description Framework)](<https://devfeed.tech/topics/rdf.md>), [graph theory](<https://devfeed.tech/topics/graph-theory.md>)

Tags: [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-lo](<https://devfeed.tech/tags/cs-lo.md>), [graph](<https://devfeed.tech/tags/graph.md>), [logic](<https://devfeed.tech/tags/logic.md>), [rdf](<https://devfeed.tech/tags/rdf.md>), [requirements](<https://devfeed.tech/tags/requirements.md>), [rules](<https://devfeed.tech/tags/rules.md>), [semantics](<https://devfeed.tech/tags/semantics.md>), [syntax](<https://devfeed.tech/tags/syntax.md>), [terms](<https://devfeed.tech/tags/terms.md>)

### AI overview

The paper addresses the open semantics of graph terms--graphs used as terms--in Notation3 Logic. It introduces an abstract syntax and defines semantics in two stages: basic entailment covers RDF triples, including those containing graph terms; N3-entailment extends this by assigning meaning to special predicates such as implication. The authors describe this extension as designed to accommodate new predicates as the developing logic grows, and as a step toward standardisation.

### Source excerpt

arXiv:2610.31266v1 Announce Type: cross Abstract: Notation3 Logic was introduced as an extension of RDF allowing the user to express rules on top of triples and to make statements about graphs. The original proposal of the logic only came with an informal specification of its semantics which has been refined later on. While this refinement clarified the meaning of rules and implicitly quantified variables, it left the meaning of graphs used as terms - so-called graph terms - open. In this paper we aim to close this gap. We discuss in detail, how graph terms are used in Notation3, which formal requirements they need to meet, and provide examples to illustrate the difficulties when defining their semantics. We then introduce an abstract syntax for the logic and define its semantics in two steps: similarly to RDF's simple interpretations, we define interpretations and basic entailment for Notation3 which covers plain RDF triples but also triples containing graph terms. N3-entailment is then an extension of basic entailment which assigns meaning to the different special predicates of the logic like for example the implication symbol. N3-entailment is defined in a way that it can be extended whenever a new predicate is added to the logic. As Notation3 Logic is currently under development, we expect many predicates to be added. Our research provides and important step towards the full standardisation of the logic.

## Automated Brick Schema Knowledge Graph Completion Across Buildings

DevFeed: [Automated Brick Schema Knowledge Graph Completion Across Buildings](<https://devfeed.tech/articles/automated-brick-schema-knowledge-graph-completion-across-buildings-94272.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2610.27339>)

Author: Daniel Ma, Jalil Huseynov, Xinyi Pan, Shaked Shalev, Zhang Chi, Ai Yamamoto, Sohei Arisaka

Published: 2026-10-21T04:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Graph Mining](<https://devfeed.tech/topics/graph-mining.md>), [Graphs](<https://devfeed.tech/topics/graphs.md>), [RDF (Resource Description Framework)](<https://devfeed.tech/topics/rdf.md>), [knowledge-engineering](<https://devfeed.tech/topics/knowledge-engineering.md>), [machine learning overfitting](<https://devfeed.tech/topics/machine-learning-overfitting.md>)

Tags: [automated](<https://devfeed.tech/tags/automated.md>), [building](<https://devfeed.tech/tags/building.md>), [completion](<https://devfeed.tech/tags/completion.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [data](<https://devfeed.tech/tags/data.md>), [equipment](<https://devfeed.tech/tags/equipment.md>), [gradient-boosted-trees](<https://devfeed.tech/tags/gradient-boosted-trees.md>), [graph](<https://devfeed.tech/tags/graph.md>), [kaggle](<https://devfeed.tech/tags/kaggle.md>), [knowledge-graph](<https://devfeed.tech/tags/knowledge-graph.md>), [machine-learning](<https://devfeed.tech/tags/machine-learning.md>), [relationships](<https://devfeed.tech/tags/relationships.md>), [schema](<https://devfeed.tech/tags/schema.md>), [sensors](<https://devfeed.tech/tags/sensors.md>), [time-series-data](<https://devfeed.tech/tags/time-series-data.md>)

### AI overview

The study frames missing Brick relationships as a knowledge graph completion problem to reduce the manual work of building Brick models from schematics and point lists. It compares gradient-boosted trees, Pairwise Brick Relation Ranking, and CompGCN for predicting feeds, hasPart, and hasPoint, using held-out MORTAR buildings plus out-of-distribution Kaggle and Building Time Series data. CompGCN performs best on held-out buildings by macro-F1 and AUPRC, but no method generalizes consistently across datasets or relations.

### Source excerpt

arXiv:2610.27339v1 Announce Type: new Abstract: The Brick schema represents building equipment, sensors, spaces, and the relationships between them as typed, multi-relational graphs, providing machine-readable metadata that supports generalizable control applications. Current methods for producing complete Brick models require extensive manual examination of building schematics and point lists. We observe that as Brick models are knowledge graphs, inferring missing relations is naturally posed as a knowledge graph completion problem. To the best of our knowledge, this is the first application of knowledge graph completion to Brick model generation. We compare three methods, gradient-boosted trees, Pairwise Brick Relation Ranking, and CompGCN, on the relations feeds, hasPart, and hasPoint, which account for the majority of the schematic-reading work in building a Brick model by hand. Models are evaluated on held-out MORTAR buildings and out-of-distribution Kaggle and Building Time Series data. Although CompGCN is the strongest performer on held-out buildings under metrics resistant to class imbalance, leading macro-F1 and AUPRC, no method generalizes uniformly across datasets or relations.

## The Technology Behind the Names: How We're Bringing Local War Memorials to Life

DevFeed: [The Technology Behind the Names: How We're Bringing Local War Memorials to Life](<https://devfeed.tech/articles/the-technology-behind-the-names-how-we-re-bringing-local-war-memorials-to-life-92459.md>)

Original publisher: [Read original article](<https://tech.findmypast.com/technology-behind-names/>)

Author: Sophie Adair

Published: 2026-10-20T13:00:00Z

Content type: article

Language: en

Sources: [Findmypast](<https://devfeed.tech/sources/findmypast.md>)

Topics: [Entity resolution](<https://devfeed.tech/topics/entity-resolution.md>), [RDF (Resource Description Framework)](<https://devfeed.tech/topics/rdf.md>), [llm-reasoning](<https://devfeed.tech/topics/llm-reasoning.md>), [Image](<https://devfeed.tech/topics/image.md>)

Tags: [agent](<https://devfeed.tech/tags/agent.md>), [ai](<https://devfeed.tech/tags/ai.md>), [ai-agent](<https://devfeed.tech/tags/ai-agent.md>), [ai-model](<https://devfeed.tech/tags/ai-model.md>), [applied-ai](<https://devfeed.tech/tags/applied-ai.md>), [archive](<https://devfeed.tech/tags/archive.md>), [data](<https://devfeed.tech/tags/data.md>), [data-scientists](<https://devfeed.tech/tags/data-scientists.md>), [engineer](<https://devfeed.tech/tags/engineer.md>), [engineering](<https://devfeed.tech/tags/engineering.md>), [family](<https://devfeed.tech/tags/family.md>), [findmypast](<https://devfeed.tech/tags/findmypast.md>), [linking](<https://devfeed.tech/tags/linking.md>), [links](<https://devfeed.tech/tags/links.md>), [local](<https://devfeed.tech/tags/local.md>), [military](<https://devfeed.tech/tags/military.md>), [records](<https://devfeed.tech/tags/records.md>), [search](<https://devfeed.tech/tags/search.md>), [stories](<https://devfeed.tech/tags/stories.md>), [technology](<https://devfeed.tech/tags/technology.md>), [war](<https://devfeed.tech/tags/war.md>)

### AI overview

Findmypast describes a project linking First World War soldiers to local memorials and reconstructing their lives from records and newspapers. It connects Soldiers Who Died in the Great War and Commonwealth War Graves Commission transcripts by name and service number, then uses birth details and CWGC family notes to link soldiers to census records and build a persistent graph of people and relationships. Embeddings help handle spelling variations, related job terms, and aliases. AI-generated newspaper searches are checked against each soldier's details; memorial matches are prioritized using birthplace, census addresses, next-of-kin locations, and newspaper name lists. Because no single source of truth exists, the project does not claim perfect memorial matching. Narratives are generated only from sourced profile facts, with uncertainty stated, and were compared with hand-researched cases. The article reports more than 9,000 memorials and 300,000 men's stories.

### Source excerpt

The Technology Behind the Names: How We're Bringing Local War Memorials to Life In a recent survey, 73% of respondents said they believe the stories behind the names on local war memorials are getting lost, and only 27% were confident they could name even one person commemorated on their local memorial. We wanted to change that and bring people the stories behind the names on their local WW1 memorials. At scale, this is no small feat. What we know about any one soldier is scattered across dozens of record sets, both military and civilian. But with Findmypast's records and newspaper archive, some carefully applied AI, and a brilliant group of engineers and data scientists, we've begun a multi-year project to do exactly that. Here's how it works. Step 1. Finding the soldiers One of the things that has never been done before at this scale is reliably link everything we know about a soldier. Russell Hunter (Engineer Mavericks team) started with two key record sets, both available on Findmypast: Soldiers Who Died in the Great War, and the Commonwealth War Graves Commission transcripts. By linking the two by name and service number we could establish the basic facts for each fallen soldier: place and date of birth, regiment, and place and date of death. From there it was a relatively short hop to medal index cards and surviving service records, giving us a clear picture of each man's service during the war. Step 2. Finding their civilian lives When it comes to finding out more about their civilian lives, we really wanted to create links from the military records to the 1891/1901/1911 census records. Birth date and place help to make these links, but the most valuable clue came from the CWGC family notes, which for many soldiers record the names and address of parents or a spouse. A search for James Bourner, born 1888, might return dozens of matches. A search for James Bourner, son of Mrs C Bourner, of Forge Square Leigh is going to narrow that down hugely. Once we were ab

## Data Engineering Weekly #292

DevFeed: [Data Engineering Weekly #292](<https://devfeed.tech/articles/data-engineering-weekly-292-89969.md>)

Original publisher: [Read original article](<https://www.dataengineeringweekly.com/p/data-engineering-weekly-292>)

Author: Ananth Packkildurai

Published: 2026-10-19T03:58:54Z

Content type: article

Language: en

Sources: [Data Engineering Weekly](<https://devfeed.tech/sources/data-engineering-weekly.md>)

Topics: [data-engineering](<https://devfeed.tech/topics/data-engineering.md>), [AI Infrastructure](<https://devfeed.tech/topics/ai-infrastructure.md>), [data observability](<https://devfeed.tech/topics/data-observability.md>), [RDF (Resource Description Framework)](<https://devfeed.tech/topics/rdf.md>), [Apache Flink](<https://devfeed.tech/topics/apache-flink.md>), [elasticsearch](<https://devfeed.tech/topics/elasticsearch.md>), [Amazon Bedrock Knowledge Bases](<https://devfeed.tech/topics/amazon-bedrock-knowledge-bases.md>), [deltalake](<https://devfeed.tech/topics/deltalake.md>)

Tags: [ai](<https://devfeed.tech/tags/ai.md>), [airbnb](<https://devfeed.tech/tags/airbnb.md>), [apache](<https://devfeed.tech/tags/apache.md>), [apache-arrow](<https://devfeed.tech/tags/apache-arrow.md>), [aws](<https://devfeed.tech/tags/aws.md>), [aws-bedrock](<https://devfeed.tech/tags/aws-bedrock.md>), [clickhouse](<https://devfeed.tech/tags/clickhouse.md>), [data](<https://devfeed.tech/tags/data.md>), [data-engineering](<https://devfeed.tech/tags/data-engineering.md>), [data-infrastructure](<https://devfeed.tech/tags/data-infrastructure.md>)

### AI overview

This issue of Data Engineering Weekly collects reports and resources on data infrastructure. Topics include Zephon's deterministic online execution for AI training data, Apache Arrow's columnar computing ecosystem, observability ontology at Netflix, Spark and Flink shuffle scaling at LinkedIn, and data ingestion, search, and surveillance systems at other companies.

### Source excerpt

The Weekly Data Engineering Newsletter

## sparqlite: SPARQL 1.1 inside SQLite, written in Rust

DevFeed: [sparqlite: SPARQL 1.1 inside SQLite, written in Rust](<https://devfeed.tech/articles/sparqlite-sparql-1-1-inside-sqlite-written-in-rust-92991.md>)

Original publisher: [Read original article](<https://simonwillison.net/2026/Oct/16/sqlite-sparql-rust/>)

Author: Simon Willison

Published: 2026-10-16T01:58:00Z

Content type: opinion

Language: en

Sources: [Simon Willison's Weblog](<https://devfeed.tech/sources/simon-willison-s-weblog.md>)

Topics: [Claude Code](<https://devfeed.tech/topics/claude-code.md>), [Rust](<https://devfeed.tech/topics/rust.md>), [RDF (Resource Description Framework)](<https://devfeed.tech/topics/rdf.md>), [SQLite](<https://devfeed.tech/topics/sqlite.md>)

Tags: [ai](<https://devfeed.tech/tags/ai.md>), [ai-2-288](<https://devfeed.tech/tags/ai-2-288.md>), [claude-code](<https://devfeed.tech/tags/claude-code.md>), [claude-code-133](<https://devfeed.tech/tags/claude-code-133.md>), [cli](<https://devfeed.tech/tags/cli.md>), [coding-agents](<https://devfeed.tech/tags/coding-agents.md>), [coding-agents-262](<https://devfeed.tech/tags/coding-agents-262.md>), [database](<https://devfeed.tech/tags/database.md>), [documentation](<https://devfeed.tech/tags/documentation.md>), [extension](<https://devfeed.tech/tags/extension.md>), [generative-ai](<https://devfeed.tech/tags/generative-ai.md>), [generative-ai-2-030](<https://devfeed.tech/tags/generative-ai-2-030.md>), [javascript](<https://devfeed.tech/tags/javascript.md>), [llms](<https://devfeed.tech/tags/llms.md>), [llms-1-996](<https://devfeed.tech/tags/llms-1-996.md>), [prompt](<https://devfeed.tech/tags/prompt.md>), [rdf](<https://devfeed.tech/tags/rdf.md>), [rdf-7](<https://devfeed.tech/tags/rdf-7.md>), [readme](<https://devfeed.tech/tags/readme.md>), [review](<https://devfeed.tech/tags/review.md>), [rust](<https://devfeed.tech/tags/rust.md>), [rust-115](<https://devfeed.tech/tags/rust-115.md>), [script](<https://devfeed.tech/tags/script.md>), [semantic-web](<https://devfeed.tech/tags/semantic-web.md>), [semantic-web-17](<https://devfeed.tech/tags/semantic-web-17.md>), [sqlite](<https://devfeed.tech/tags/sqlite.md>), [sqlite-489](<https://devfeed.tech/tags/sqlite-489.md>), [subagents](<https://devfeed.tech/tags/subagents.md>), [tutorial](<https://devfeed.tech/tags/tutorial.md>), [vibe-coding](<https://devfeed.tech/tags/vibe-coding.md>), [workflows](<https://devfeed.tech/tags/workflows.md>)

### AI overview

The author used Claude Code for web in "Ultracode" mode to build what appears to be a Rust implementation of SPARQL inside a SQLite extension. An initial prompt led the system to work for more than 12 hours; a follow-up requested READMEs for each crate, a tutorial covering installation, SQLite CLI use and SPARQL, and a script to populate realistic tutorial data. The author says the resulting code is not feasible for them to review and that understanding its documentation would take substantial effort, leaving the project's value uncertain. The article describes an experiment and the author's concerns; it does not establish the implementation's completeness, speed, or reliability.

### Source excerpt

Research: sparqlite: SPARQL 1.1 inside SQLite, written in Rust This research task is really an experiment in running Claude Code for web in "Ultracode" mode, as described in Orchestrate subagents at scale with dynamic workflows in the Claude Code documentation. With Ultracode turned on, Claude Code makes aggressive use of dynamic workflows - it generates JavaScript that defines and coordinates a network of subagents to take on complex problems. My initial prompt was this - I meant "hit the rows directly", the word "delete" was an accidental typo on my phone: Write a SQLite extension in Rust that implants SPARQL and runs really fast because it can hit the delete rows directly This caused Claude Code for web to churn for over 12 hours. I checked in on its progress the next day and sent a single follow-up prompt when I noticed how many Rust crates it had built: Every folder in the crates/ directory needs a README Include a tutorial.md teaching users how to install the extension and how to run it in the SQLite CLI and then teaching them SPARQL in addition to how to use the SQLite extension Include a script with the tutorial for populating a SQLite database with useful and realistic example data for that tutorial This project feels like next-level vibe coding - it's not remotely feasible to review the code that was produced here, and even following the documentation is a significant investment in work. I'm not entirely sure what to do with this - I appear to have a full SPARQL implementation in Rust inside SQLite now, but how valuable is that if I created it on a whim and can't (or won't) invest the necessary time to understand what it can do? Tags: rdf, semantic-web, sqlite, ai, rust, generative-ai, llms, coding-agents, claude-code

## Why Knowledge Graphs and Ontologies Are Making a Comeback in the Age of AI

DevFeed: [Why Knowledge Graphs and Ontologies Are Making a Comeback in the Age of AI](<https://devfeed.tech/articles/why-knowledge-graphs-and-ontologies-are-making-a-comeback-in-the-age-of-ai-86943.md>)

Original publisher: [Read original article](<https://hackernoon.com/why-knowledge-graphs-and-ontologies-are-making-a-comeback-in-the-age-of-ai?source=rss>)

Author: George Anadiotis

Published: 2026-10-14T06:12:40Z

Content type: article

Language: en

Sources: [HackerNoon](<https://devfeed.tech/sources/hackernoon.md>)

Topics: [Artificial Intelligence](<https://devfeed.tech/topics/ai.md>), [graph theory](<https://devfeed.tech/topics/graph-theory.md>), [knowledge-engineering](<https://devfeed.tech/topics/knowledge-engineering.md>), [RDF (Resource Description Framework)](<https://devfeed.tech/topics/rdf.md>), [observability](<https://devfeed.tech/topics/observability.md>), [AI Context Management](<https://devfeed.tech/topics/ai-context-management.md>)

Tags: [agent-memory](<https://devfeed.tech/tags/agent-memory.md>), [agentic-ai](<https://devfeed.tech/tags/agentic-ai.md>), [ai](<https://devfeed.tech/tags/ai.md>), [artificial-intelligence](<https://devfeed.tech/tags/artificial-intelligence.md>), [context-graph](<https://devfeed.tech/tags/context-graph.md>), [data-modeling](<https://devfeed.tech/tags/data-modeling.md>), [data-science](<https://devfeed.tech/tags/data-science.md>), [graph-rag](<https://devfeed.tech/tags/graph-rag.md>), [graphs](<https://devfeed.tech/tags/graphs.md>), [knowledge-graph](<https://devfeed.tech/tags/knowledge-graph.md>), [knowledge-graphs](<https://devfeed.tech/tags/knowledge-graphs.md>), [ontologies](<https://devfeed.tech/tags/ontologies.md>), [ontology](<https://devfeed.tech/tags/ontology.md>)

### AI overview

The article surveys renewed interest in knowledge graphs and ontologies as foundations for enterprise AI systems. It describes how semantic models can clarify data meaning, while context graphs capture changing states and decisions and governance controls constrain agent actions. It also reviews agent memory, graph-based retrieval, ontology automation, implementation challenges, and ecosystem developments, noting that generated models still require validation.

### Source excerpt

Context runs the spectrum of semantics, state, and controls.

## How MUFG Bank aims to cut flowchart work by up to 90% with ontology-grounded AI on Amazon Neptune and Amazon Bedrock

DevFeed: [How MUFG Bank aims to cut flowchart work by up to 90% with ontology-grounded AI on Amazon Neptune and Amazon Bedrock](<https://devfeed.tech/articles/how-mufg-bank-aims-to-cut-flowchart-work-by-up-to-90-with-ontology-grounded-ai-on-amazon-neptune-and-amazon-bedrock-77467.md>)

Original publisher: [Read original article](<https://aws.amazon.com/blogs/database/how-mufg-bank-aims-to-cut-flowchart-work-by-up-to-90-with-ontology-grounded-ai-on-amazon-neptune-and-amazon-bedrock/>)

Author: Ozan Eken

Published: 2026-10-08T15:24:02Z

Content type: article

Language: en

Sources: [AWS Database Blog](<https://devfeed.tech/sources/aws-database-blog.md>)

Topics: [Amazon Bedrock Knowledge Bases](<https://devfeed.tech/topics/amazon-bedrock-knowledge-bases.md>), [Amazon Bedrock](<https://devfeed.tech/topics/amazon-bedrock.md>), [RDF (Resource Description Framework)](<https://devfeed.tech/topics/rdf.md>), [AI Context Management](<https://devfeed.tech/topics/ai-context-management.md>), [AI-enhanced product development](<https://devfeed.tech/topics/ai-enhanced-product-development.md>)

Tags: [advanced-300](<https://devfeed.tech/tags/advanced-300.md>), [ai](<https://devfeed.tech/tags/ai.md>), [ai-agent](<https://devfeed.tech/tags/ai-agent.md>), [ai-assisted](<https://devfeed.tech/tags/ai-assisted.md>), [amazon-bedrock](<https://devfeed.tech/tags/amazon-bedrock.md>), [amazon-neptune](<https://devfeed.tech/tags/amazon-neptune.md>), [customer-solutions](<https://devfeed.tech/tags/customer-solutions.md>), [generative-ai](<https://devfeed.tech/tags/generative-ai.md>), [ontology](<https://devfeed.tech/tags/ontology.md>)

### AI overview

MUFG Bank built AI Flowchart, an application that grounds generative AI in an ontology and branch-level knowledge graphs stored in Amazon Neptune. An agent retrieves relevant graph data to constrain flowchart generation and cite its supporting nodes and edges. The article reports that the application is expected to reduce system-development effort per branch-procedure standardization from 11 person-days to 1, while leaving standardization decisions to bank experts.

### Source excerpt

MUFG Bank standardized overseas back-office procedures across roughly 30 countries by grounding generative AI in a structured domain model on Amazon Neptune and Amazon Bedrock. Its AI Flowchart application is expected to cut the system-development effort behind each branch-procedure standardization from 11 person-days to 1, a reduction of up to 90%.

## Amagi's intelligent media operations with Amazon Neptune

DevFeed: [Amagi's intelligent media operations with Amazon Neptune](<https://devfeed.tech/articles/amagi-s-intelligent-media-operations-with-amazon-neptune-65160.md>)

Original publisher: [Read original article](<https://aws.amazon.com/blogs/database/amagis-intelligent-media-operations-with-amazon-neptune/>)

Author: Ajith N N

Published: 2026-10-05T15:24:12Z

Content type: article

Language: en

Sources: [AWS Database Blog](<https://devfeed.tech/sources/aws-database-blog.md>)

Topics: [RDF (Resource Description Framework)](<https://devfeed.tech/topics/rdf.md>), [Amazon OpenSearch Service](<https://devfeed.tech/topics/amazon-opensearch-service.md>), [cephfs](<https://devfeed.tech/topics/cephfs.md>)

Tags: [amazon-neptune](<https://devfeed.tech/tags/amazon-neptune.md>), [amazon-opensearch-service](<https://devfeed.tech/tags/amazon-opensearch-service.md>), [customer-solutions](<https://devfeed.tech/tags/customer-solutions.md>), [intermediate-200](<https://devfeed.tech/tags/intermediate-200.md>), [knowledge-graph](<https://devfeed.tech/tags/knowledge-graph.md>), [rdf](<https://devfeed.tech/tags/rdf.md>), [synchronization](<https://devfeed.tech/tags/synchronization.md>)

### AI overview

Amagi built a Global Metadata Store on Amazon Neptune to manage deeply connected media metadata across its operations. The article explains how it synchronizes anonymous RDF blank nodes with Amazon OpenSearch Service, routing deep graph queries to Neptune and high-volume reads to the search index. It reports sub-500 ms transactional reads and describes the eventual consistency trade-off for indexed data.

### Source excerpt

Amagi built a Global Metadata Store on Amazon Neptune to model billions of interconnected media metadata relationships. Learn how their RDF knowledge graph, paired with Amazon OpenSearch Service and a custom blank-node synchronization layer, delivers deep semantic queries and sub-500ms transactional reads across 2,500+ channels and 150+ countries.

## Use Graph RAG when relationships are part of the evidence

DevFeed: [Use Graph RAG when relationships are part of the evidence](<https://devfeed.tech/articles/use-graph-rag-when-relationships-are-part-of-the-evidence-63140.md>)

Original publisher: [Read original article](<https://thenewstack.io/when-to-use-graph-rag/>)

Author: Jeremy Daly

Published: 2026-10-01T13:30:00Z

Content type: article

Language: en

Sources: [The New Stack](<https://devfeed.tech/sources/the-new-stack.md>)

Topics: [Embeddings](<https://devfeed.tech/topics/embeddings.md>), [RDF (Resource Description Framework)](<https://devfeed.tech/topics/rdf.md>), [graph-database](<https://devfeed.tech/topics/graph-database.md>)

Tags: [ai-agents](<https://devfeed.tech/tags/ai-agents.md>), [ai-engineering](<https://devfeed.tech/tags/ai-engineering.md>), [data](<https://devfeed.tech/tags/data.md>), [database](<https://devfeed.tech/tags/database.md>), [databases](<https://devfeed.tech/tags/databases.md>), [has](<https://devfeed.tech/tags/has.md>), [oracle](<https://devfeed.tech/tags/oracle.md>), [post-contributed](<https://devfeed.tech/tags/post-contributed.md>), [rag](<https://devfeed.tech/tags/rag.md>), [relationships](<https://devfeed.tech/tags/relationships.md>), [sponsor-oracle](<https://devfeed.tech/tags/sponsor-oracle.md>), [sponsored-post-contributed](<https://devfeed.tech/tags/sponsored-post-contributed.md>)

### AI overview

The article explains when Graph RAG can improve answers in software systems: when they require tracing relationships among records, such as service dependencies, customer environments, and policies. It recommends combining semantic retrieval with traversal over known, operational relationships, enforcing access and freshness limits, and preserving sources and provenance. It also outlines cases where vector retrieval alone is sufficient and suggests piloting a specific multi-entity decision.

### Source excerpt

Which team owns the service that depends on the vulnerable library? Which customers use that service, and what does each The post Use Graph RAG when relationships are part of the evidence appeared first on The New Stack.

## The dream of enterprise semantics: Why this time is different

DevFeed: [The dream of enterprise semantics: Why this time is different](<https://devfeed.tech/articles/the-dream-of-enterprise-semantics-why-this-time-is-different-63161.md>)

Original publisher: [Read original article](<https://www.infoworld.com/article/4229154/the-dream-of-enterprise-semantics-why-this-time-is-different.html>)

Author: Suresh Srinivas

Published: 2026-10-01T09:00:00Z

Content type: opinion

Language: en

Sources: [InfoWorld](<https://devfeed.tech/sources/infoworld.md>)

Topics: [semantic-layer](<https://devfeed.tech/topics/semantic-layer.md>), [AI Context Management](<https://devfeed.tech/topics/ai-context-management.md>), [RDF (Resource Description Framework)](<https://devfeed.tech/topics/rdf.md>), [AI Chat](<https://devfeed.tech/topics/ai-chat.md>), [Frontier AI](<https://devfeed.tech/topics/frontier-ai.md>)

Tags: [agent](<https://devfeed.tech/tags/agent.md>), [analytics](<https://devfeed.tech/tags/analytics.md>), [analytics-data-management](<https://devfeed.tech/tags/analytics-data-management.md>), [anthropic](<https://devfeed.tech/tags/anthropic.md>), [data](<https://devfeed.tech/tags/data.md>), [data-agents](<https://devfeed.tech/tags/data-agents.md>), [data-management](<https://devfeed.tech/tags/data-management.md>), [openai](<https://devfeed.tech/tags/openai.md>), [rdf](<https://devfeed.tech/tags/rdf.md>)

### AI overview

The article argues that AI can make enterprise semantics practical by helping build and maintain a shared context layer combining data metadata, business ontologies, and organizational memory. It says agents could use this context to answer business questions more accurately, while humans review AI-proposed ontology updates. The claimed accuracy and query workload improvements are attributed to the author's internal tests.

### Source excerpt

In most companies, the struggle to answer a new question fast has nothing to do with a lack of data. The problem is a lack of semantics. Or to put it another way, a lack of agreement about what the data means. Suppose a CFO wants to generate a new report on revenue by customer segment. It sounds simple, but in practice, for the employees tasked with executing the CFO's directive, it means a multi-day argument about what a "customer segment" even is. Before they can make the report, they need to define the terms of the report. The dream of enterprise semantics, as I define it, is that someone who understands the business should be able to talk to an intelligent data agent and get the answer they need without knowing how the data is structured or stored. No more tickets. No more definitional arguments. For decades, we've tried to do better. We even created solutions for enterprise semantics, but the work required was too much. AI changes the equation. As the data agents at OpenAI and Anthropic have shown, the dream of enterprise semantics has come to life. We've tried this before The dream of machine-readable business meaning is not new. After inventing the World Wide Web in 1989, Tim Berners-Lee proposed an idea in 1999 called the Semantic Web. He argued that if everyone tagged their web pages according to machine-readable standards, internet search would become far more powerful. Standards such as RDF, OWL, and SKOS emerged to let people tag content according to ontologies that captured meaning and enabled reasoning. But the effort never took off. Building an ontology that actually worked for a business required rare hybrid expertise, months of workshops, and constant upkeep as the business changed. Most projects produced a carefully built ontology for one narrow domain, then collapsed once the team moved on or the business outgrew the map. The standards themselves survived: RDF, OWL, and many standard vocabularies form the foundation of serious data management toda

## Localised page metadata

DevFeed: [Localised page metadata](<https://devfeed.tech/articles/localised-page-metadata-89116.md>)

Original publisher: [Read original article](<https://specification.website/spec/i18n/localised-metadata/>)

Author: Joost de Valk

Published: 2026-05-29T18:54:03Z

Content type: tutorial

Language: en

Sources: [The Website Specification](<https://devfeed.tech/sources/the-website-specification.md>)

Topics: [Open Graph protocol](<https://devfeed.tech/topics/open-graph.md>), [alt text](<https://devfeed.tech/topics/alt-text.md>), [Microformats](<https://devfeed.tech/topics/microformats.md>), [RDF (Resource Description Framework)](<https://devfeed.tech/topics/rdf.md>)

Tags: [english](<https://devfeed.tech/tags/english.md>), [i18n](<https://devfeed.tech/tags/i18n.md>), [recommended](<https://devfeed.tech/tags/recommended.md>), [structured-data](<https://devfeed.tech/tags/structured-data.md>), [translation](<https://devfeed.tech/tags/translation.md>)

### AI overview

A tutorial on localizing website metadata alongside page content. It covers translating titles, descriptions, Open Graph and Twitter Card fields, JSON-LD properties, image alt text, and PWA manifest names, plus setting locale attributes and checking rendered results across search and social previews.

### Source excerpt

Translate every visible string in the head and in structured data -- title, meta description, Open Graph fields, JSON-LD names and descriptions, image alt text -- not just the body. A localised body with English metadata is a half-translation.

[Next page](<https://devfeed.tech/topics/rdf.md?cursor=WyIyMDI2LTA1LTI5VDE4OjU0OjAzKzAwOjAwIiwgIjY1M2I4MzY2LTliYjctNDM2Zi1hMDEzLTk4Y2RlZTJiNTgxOSJd>)