1 citations · 1 across the 7 of their papers we have counts for
8 papers
MERIT: Scaling KG Foundation Models with Relation Transformers
Cosimo Gregucci, Daniel Hernandez, Antonio Vergari +1
Knowledge graph (KG) foundation models (KGFMs) predict links on unseen graphs zero-shot. KGFMs have been pioneered by ULTRA which builds a relation graph from co-occurrences that m…
FITTER: Vocabulary-Agnostic Cross-Domain Inference on Temporal Knowledge Graphs
Jiaxin Pan, Mojtaba Nayyeri, Osama Mohammed +4
Temporal knowledge graphs are central to many uses of the Semantic Web, but existing completion methods assume the entities, relation names, and timestamps to be reasoned about are…
GRATE: Temporal Extensions for Inductive KG Foundation Models via Gated Rotary Attention
Jiaxin Pan, Osama Mohammed, Daniel Hernández +1
Knowledge graph foundation models such as Ultra and Trix achieve strong inductive transfer by learning relation-graph representations that generalise to unseen entities and relatio…
On the Semantics of Generative SPARQL
Ratan Bahadur Thapa, Steffen Staab
We extend SPARQL with a generative query construct, called \tx{GenOp}, whose evaluation calls a language model and produces typed solution mappings. We define the semantics of the…
Half a Link can Be Enough to Predict a Whole Link: Understanding Generalization in Knowledge Graph Foundation Models
Cosimo Gregucci, Obaidah Theeb, Daniel Hernandez +2
Knowledge graph (KG) foundation models (KGFMs) are zero-shot generalizers: trained once, they can predict links on unseen graphs without retraining. However, understanding when and…
Towards Foundation Model on Temporal Knowledge Graph Reasoning
Jiaxin Pan, Mojtaba Nayyeri, Osama Mohammed +4
Temporal Knowledge Graphs (TKGs) store temporal facts with quadruple formats (s, p, o, t). Existing Temporal Knowledge Graph Embedding (TKGE) models perform link prediction tasks i…
Is Complex Query Answering Really Complex?
Cosimo Gregucci, Bo Xiong, Daniel Hernandez +4
Complex query answering (CQA) on knowledge graphs (KGs) is gaining momentum as a challenging reasoning task. In this paper, we show that the current benchmarks for CQA might not be…
eSPARQL: Representing and Reconciling Agnostic and Atheistic Beliefs in RDF-star Knowledge Graphs
Xinyi Pan, Daniel Hernández, Philipp Seifer +2
Over the past few years, we have seen the emergence of large knowledge graphs combining information from multiple sources. Sometimes, this information is provided in the form of as…