most citedSoft Reasoning Paths for Knowledge Graph Completion

1 citations · 1 across the 6 of their papers we have counts for

collaborators

6 papers

cs.AI2026

AutoViewMem: Self-Configuring Orthogonal Views for Conversational Long-Term Memory

Zijie Cao, Xijun Qu, Zhicheng Gu +7

Long-term memory is essential for large language model (LLM) agents to maintain consistency and personalization over extended interactions. Existing memory systems typically rely o…

cs.CL2026

Harness-G: A Graph-Structured Harness for Search Agents

Yanning Hou, Haoyuan Chen, Sihang Zhou +7

Reinforcement learning (RL) search agents commonly model retrieval as free-form natural-language query generation and optimize multi-turn interactions using final-answer rewards. C…

cs.LG2026

Decoupled Travel Planning with Behavior Forest

Duanyang Yuan, Sihang Zhou, Yanning Hou +7

Behavior sequences, composed of executable steps, serve as the operational foundation for multi-constraint planning problems such as travel planning. In such tasks, each planning s…

cs.IR2026

AtomicRAG: Atom-Entity Graphs for Retrieval-Augmented Generation

Yanning Hou, Duanyang Yuan, Sihang Zhou +5

Recent GraphRAG methods integrate graph structures into text indexing and retrieval, using knowledge graph triples to connect text chunks, thereby improving retrieval coverage and…

cs.IR2025★ 1 cited

Soft Reasoning Paths for Knowledge Graph Completion

Yanning Hou, Sihang Zhou, Ke Liang +6

Reasoning paths are reliable information in knowledge graph completion (KGC) in which algorithms can find strong clues of the actual relation between entities. However, in real-wor…

cs.IR2025

Knowledge Graph Completion with Relation-Aware Anchor Enhancement

Duanyang Yuan, Sihang Zhou, Xiaoshu Chen +4

Text-based knowledge graph completion methods take advantage of pre-trained language models (PLM) to enhance intrinsic semantic connections of raw triplets with detailed text descr…