Graphs and matching techniques are a well-studied topic. In this paper, we individuate a sub-class of graphs, which we call semantic graphs, characterized by labels whose meaning is independent from their occurrence in graph. We show how this changes the meaning of graph nodes and, consequently, the matching problem. Finally, we propose an algorithm for matching semantic graphs
Matching Semantic Graphs
Serafini, Luciano;
2005-01-01
Abstract
Graphs and matching techniques are a well-studied topic. In this paper, we individuate a sub-class of graphs, which we call semantic graphs, characterized by labels whose meaning is independent from their occurrence in graph. We show how this changes the meaning of graph nodes and, consequently, the matching problem. Finally, we propose an algorithm for matching semantic graphsFile in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
