Multi-hop knowledge graph (KG) reasoning has been widely studied in recent years to provide interpretable predictions on missing links with evidential paths. Most previous works use reinforcement learning (RL) based methods that learn to navigate the path towards the target entity. However, these methods suffer from slow and poor convergence, and they may fail to infer a certain path when there is a missing edge along the path. Here we present SQUIRE, the first Sequence-to-sequence based multi-hop reasoning framework, which utilizes an encoder-decoder Transformer structure to translate the query to a path. Our framework brings about two benefits: (1) It can learn and predict in an end-to-end fashion, which gives better and faster convergenc...
Knowledge Graphs typically suffer from incompleteness. A popular approach to knowledge graph complet...
Path queries on a knowledge graph can be used to answer compositional ques-tions such as “What langu...
Previous knowledge graph embedding approaches usually map entities to representations and utilize sc...
Large scale knowledge graphs (KGs) such as Freebase are generally incomplete. Reasoning over multi-h...
The opaqueness of the multi-hop fact verification model imposes imperative requirements for explaina...
Recent works on knowledge base question answering (KBQA) retrieve subgraphs for easier reasoning. A ...
Answering natural language questions on knowledge graphs (KGQA) remains a great challenge in terms o...
Due to the success of Graph Neural Networks (GNNs) in learning from graph-structured data, various G...
Knowledge Base Question Answering (KBQA) aims to answer userquestions from a knowledge base (KB) by ...
Multi-hop Knowledge Base Question Answering(KBQA) aims to find the answer entity in a knowledge base...
Human beings have always tried to pass down knowledge to preserve it and let further generations exp...
Multi-hop reasoning over real-life knowledge graphs (KGs) is a highly challenging problem as traditi...
Knowledge graphs (KGs) inherently lack reasoning ability which limits their effectiveness for tasks ...
Knowledge Graphs typically suffer from incompleteness. A popular approach to knowledge graph complet...
In recent years, Knowledge Graph (KG) development has attracted significant researches considering t...
Knowledge Graphs typically suffer from incompleteness. A popular approach to knowledge graph complet...
Path queries on a knowledge graph can be used to answer compositional ques-tions such as “What langu...
Previous knowledge graph embedding approaches usually map entities to representations and utilize sc...
Large scale knowledge graphs (KGs) such as Freebase are generally incomplete. Reasoning over multi-h...
The opaqueness of the multi-hop fact verification model imposes imperative requirements for explaina...
Recent works on knowledge base question answering (KBQA) retrieve subgraphs for easier reasoning. A ...
Answering natural language questions on knowledge graphs (KGQA) remains a great challenge in terms o...
Due to the success of Graph Neural Networks (GNNs) in learning from graph-structured data, various G...
Knowledge Base Question Answering (KBQA) aims to answer userquestions from a knowledge base (KB) by ...
Multi-hop Knowledge Base Question Answering(KBQA) aims to find the answer entity in a knowledge base...
Human beings have always tried to pass down knowledge to preserve it and let further generations exp...
Multi-hop reasoning over real-life knowledge graphs (KGs) is a highly challenging problem as traditi...
Knowledge graphs (KGs) inherently lack reasoning ability which limits their effectiveness for tasks ...
Knowledge Graphs typically suffer from incompleteness. A popular approach to knowledge graph complet...
In recent years, Knowledge Graph (KG) development has attracted significant researches considering t...
Knowledge Graphs typically suffer from incompleteness. A popular approach to knowledge graph complet...
Path queries on a knowledge graph can be used to answer compositional ques-tions such as “What langu...
Previous knowledge graph embedding approaches usually map entities to representations and utilize sc...