SELECT ?property ?value WHERE { BIND (?? AS ?s) ?s ?property ?value . FILTER (isLiteral(?value)) } LIMIT 1000

Attributes

Wissensgraph
knowledge graph
grafo della conoscenza
graphe de connaissances
Rete semantica che rappresenta una rete di entità del mondo reale, come oggetti, eventi, situazioni o concetti e illustra il rapporto tra di loro.
Semantic network that represents a network of real-world entities, such as objects, events, situations or concepts, and illustrates the relationship between them.
Réseau sémantique qui représente un réseau d’entités du monde réel, telles que des objets, des événements, des situations ou des concepts, et illustre la relation entre ces entités.
Semantisches Netzwerk, das Entitäten aus der realen Welt (Objekte, Ereignisse, Situationen oder Konzepte) darstellt und die Beziehung zwischen ihnen verbildlicht.
2025-09-29T12:56:59.9144960Z
520666
https://www.termdat.bk.admin.ch/entry/520666
ontotext, What Is a Knowledge Graph? ([Internet, 2025-04-29](https://www.ontotext.com/knowledgehub/fundamentals/what-is-a-knowledge-graph/))
IBM, Cos'è un grafo della conoscenza? ([Internet, 2025-04-29](https://www.ibm.com/it-it/think/topics/knowledge-graph))
IBM, Qu’est-ce qu’un graphe de connaissances ? ([Internet, 2025-09-29](https://www.ibm.com/fr-fr/think/topics/knowledge-graph))
IBM, Was ist ein Wissensgraph? ([Internet, 2025-09-29](https://www.ibm.com/de-de/think/topics/knowledge-graph))
EXP: a knowledge graph is made up of three main components: nodes, edges, and labels (a); knowledge graphs put data in context via linking and semantic metadata and this way provide a framework for data integration, unification, analytics and sharing (b)
EXP: un grafo della conoscenza è composto da tre componenti principali: nodi, archi/spigoli ed etichette
EXP: ein Wissensgraph besteht aus drei Hauptkomponenten: Knoten, Kanten und Bezeichner
EXP: un graphe de connaissance inclut trois composants principaux : des nœuds, des arcs et des étiquettes
secondo IBM, Cos'è un grafo della conoscenza? ([Internet, 2025-04-29](https://www.ibm.com/it-it/think/topics/knowledge-graph))
(a) IBM, What is a knowledge graph? ([Internet, 2025-09-29](https://www.ibm.com/think/topics/knowledge-graph)); (b) ontotext, What Is a Knowledge Graph? ([Internet, 2025-04-29](https://www.ontotext.com/knowledgehub/fundamentals/what-is-a-knowledge-graph/))
IBM, Was ist ein Wissensgraph? ([Internet, 2025-09-29](https://www.ibm.com/de-de/think/topics/knowledge-graph))
d'après IBM, Qu’est-ce qu’un graphe de connaissances ? ([Internet, 2025-09-29](https://www.ibm.com/fr-fr/think/topics/knowledge-graph))
secondo IBM, Cos'è un grafo della conoscenza? ([Internet, 2025-04-29](https://www.ibm.com/it-it/think/topics/knowledge-graph))
after IBM, What is a knowledge graph? ([Internet, 2025-09-29](https://www.ibm.com/think/topics/knowledge-graph))
d'après IBM, Qu’est-ce qu’un graphe de connaissances ? ([Internet, 2025-09-29](https://www.ibm.com/fr-fr/think/topics/knowledge-graph))
nach IBM, Was ist ein Wissensgraph? ([Internet, 2025-09-29](https://www.ibm.com/de-de/think/topics/knowledge-graph))
SELECT ?property ?object WHERE { BIND (?? AS ?s) ?s ?property ?object . FILTER (isIRI(?object)) FILTER (?property != rdf:type) FILTER (?property != rdfs:subClassOf) } LIMIT 1000
SELECT ?property ?subject WHERE { BIND (?? AS ?o) ?subject ?property ?o . FILTER (?property != rdf:type) FILTER (?property != rdfs:subClassOf) } LIMIT 1000
Incoming Relationships: No results found.
SELECT ?instance ?description WHERE { BIND (?? AS ?class) ?instance (rdf:type|owl:type) ?class . OPTIONAL { ?instance schema:description ?description . } } LIMIT 5000
Instances of this Class: No results found.
SELECT ?superclass ?description WHERE { ?? rdfs:subClassOf ?superclass . OPTIONAL { ?superclass (rdfs:comment|schema:description) ?description . } } LIMIT 5000
Superclasses of this Class: No results found.
SELECT ?subclass ?description WHERE { ?subclass rdfs:subClassOf ?? . OPTIONAL { ?subclass (rdfs:comment|schema:description) ?description . } } LIMIT 5000
Subclasses of this Class: No results found.