Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
80 tokens/sec
GPT-4o
59 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
7 tokens/sec
GPT-4.1 Pro
50 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Combining Inductive and Deductive Reasoning for Query Answering over Incomplete Knowledge Graphs (2106.14052v2)

Published 26 Jun 2021 in cs.AI, cs.DB, and cs.LG

Abstract: Current methods for embedding-based query answering over incomplete Knowledge Graphs (KGs) only focus on inductive reasoning, i.e., predicting answers by learning patterns from the data, and lack the complementary ability to do deductive reasoning, which requires the application of domain knowledge to infer further information. To address this shortcoming, we investigate the problem of incorporating ontologies into embedding-based query answering models by defining the task of embedding-based ontology-mediated query answering. We propose various integration strategies into prominent representatives of embedding models that involve (1) different ontology-driven data augmentation techniques and (2) adaptation of the loss function to enforce the ontology axioms. We design novel benchmarks for the considered task based on the LUBM and the NELL KGs and evaluate our methods on them. The achieved improvements in the setting that requires both inductive and deductive reasoning are from 20% to 55% in HITS@3.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (5)
  1. Trung-Kien Tran (7 papers)
  2. Csaba Domokos (4 papers)
  3. Pasquale Minervini (88 papers)
  4. Daria Stepanova (12 papers)
  5. Medina Andresel (3 papers)
Citations (1)