arXiv:2606. 28076v1 Announce Type: new Abstract: Knowledge graph question answering (KGQA) aims to answer natural-language questions by reasoning over structured facts.
arXiv:2609.14528v1 Announce Type: cross Abstract: Multi-Hop Knowledge Graph Question Answering (KGQA) tasks require models to assemble relational evidence along paths in a KG to answer natural-langua...
The paper introduces a neuro‑symbolic framework for constructing knowledge graphs (KGs) that are grounded in an ontology. It combines open‑domain extraction, embedding‑based canonicalization of types and predicates, and a post‑extraction LLM‑based correction step to fix ontology violations, thereby reducing token usage and improving KG consistency. The resulting KGs support symbolic querying, as evidenced by the prevalence of SPARQL graph patterns in the extracted data.
arXiv:2608.22762v1 Announce Type: new Abstract: Knowledge graph question answering (KGQA) is a key task for evaluating KG-augmented Large Language Models (LLMs), and complex KGQA that requires multi-...
arXiv:2502. 11491v3 Announce Type: replace-cross Abstract: Large language models (LLMs) have shown remarkable capabilities in natural language processing.
arXiv:2609.39786v1 Announce Type: new Abstract: Large language models (LLMs) are increasingly combined with knowledge graphs (KGs) to ground reasoning in structured evidence. However, most LLM-based...
arXiv:2607. 22597v1 Announce Type: new Abstract: Multi-hop question answering requires systems to retrieve evidence from multiple documents and connect scattered facts into a coherent reasoning process.
arXiv:2606. 17856v1 Announce Type: new Abstract: Graph-based retrieval-augmented generation (GraphRAG) is effective for knowledge-intensive and multi-hop query tasks; however, many existing methods primarily seed entity-based graphs and rely on implicit semantic relevance propagation.
Hi-Q is a new framework for multi‑hop question answering that refines queries hierarchically based on evidence retrieved from a corpus. At each node it tests whether the current query unit is supported by evidence; if not, the node is expanded using a dependency‑preserving binary operator and verified for semantic coverage. The resulting query tree grows according to corpus support signals, and Hi‑Q achieves state‑of‑the‑art performance on three multi‑hop QA benchmarks, outperforming both iterative retrieval and graph‑based baselines without constructing a corpus‑wide graph.
VISPATH is a visual‑intent‑guided path reasoning framework designed for multimodal knowledge graph question answering (MM‑KGQA). It first identifies a reliable starting entity by fusing multimodal grounding with graph‑structural cues, then iteratively discovers and refines reasoning paths using hop‑specific multimodal intent and a reasoning‑chain pruning step. The framework is evaluated on the newly introduced VISPATH‑Bench, which tests two‑to‑four‑hop reasoning, and demonstrates consistent improvements over strong baselines, even surpassing GPT‑5.4 when using GPT‑4o as the backbone.
arXiv:2609.35816v1 Announce Type: cross Abstract: Large language model search agents are often trained with synthetic questions whose difficulty is increased through larger evidence graphs, additiona...
arXiv:2607. 14494v1 Announce Type: new Abstract: Complex knowledge base question answering (KBQA) is commonly approached through either information retrieval over a question-specific subgraph or semantic parsing into an executable logical form.
arXiv:2606. 00328v1 Announce Type: new Abstract: Large language models (LLMs) are increasingly used for knowledge base question answering (KBQA), where answering requires selecting entities from a question-specific knowledge-graph subgraph.