A rule-based memory framework that induces reusable logical rules from historical interactions to guide both evidence retrieval and reasoning, and constructs natural-language Horn clauses from conversations and validates them via a Rule Perplexity Consistency (RPC) mechanism.
Abstract
Question answering agents in long-term conversations must reason over massive, temporally dispersed dialogue histories. However, existing memory mechanisms primarily treat past information as \textit{passively} stored facts, leading to semantic gaps and unreliable reasoning. To address this limitation, we propose RuleMem, a rule-based memory framework that induces reusable logical rules from historical interactions to \textit{actively} guide both evidence retrieval and reasoning. Specifically, RuleMem constructs natural-language Horn clauses from conversations and validates them via a Rule Perplexity Consistency (RPC) mechanism. These induced rules enable the retrieval of semantically distant evidence while providing an explicit logical structure for answer generation. We conducted a comprehensive evaluation of RuleMem on two long-term conversational benchmarks, LoCoMo and LongMemEval_s*. In a rigorous comparison against 14 baselines on LoCoMo, RuleMem achieved the highest accuracy, exceeding the baseline average by 27.47 points (a 54.3% relative improvement).
This work investigates whether memory interference originates mainly from memory retrieval or from the accumulation of competing fact versions added during memory updates, and evaluates how memory-write policies influence memory retrieval behavior later on.
Erica Butts, Salam Daher· Proceedings of the 26th ACM...· 0 citations
Large language models deployed as personalized assistants must reason over long, evolving interaction histories. However, in long-term dialogue reasoning, relevant evidence is scattered across sessions, preferences may be revised over time, and standard long-context training fails to address these challenges under data...
Na-En Xu, Wan-Qing Cui, Yi-Bo Hu et al.· 0 citations
The results indicate that for precise, evidence-grounded questions over chat archives, much of the benefit credited to elaborate memory structures is recoverable by giving an agent controllable search over the unmodified record, with no LLM-based index construction at all.
Ruizhe Li, L. Zhang, Benfeng Xu et al.· 1 citation
It is hypothesize that existing benchmarks and user satisfaction are tracking different capabilities: benchmarks measure elicited retrieval (recall when asked), while conversation requires natural integration (detecting relevance and naturally weaving prior context into a response).
Ryuichi Sumida, K. Inoue, Tatsuya Kawahara· 0 citations
Results show that entity-structured indexing and episode-level provenance provide a reliable foundation for long-term memory in agents, and EnSIMem achieves high answer accuracy while maintaining compact, evidence-focused contexts.
Xuan-Yu Meng, Xing Fan, Xin-Yi Fan et al.· 0 citations
A structured memory framework for query-conditioned user-state inference for long-term personalization that achieves state-of-the-art performance on both PersonaMem and KnowU-Bench, demonstrating the effectiveness of query-conditioned user-state inference for long-term personalization.
Heng Wang, Yifei Li, Lingling Zhang et al.· 0 citations
Related blog posts
MIT News · Artificial Intelligence· news.mit.eduOct 15, 2026
A new computational approach reveals how cells communicate to assemble into tissues. This could accelerate stem cell engineering, improve disease models, and inform therapies.
Microsoft Research Blog· microsoft.comOct 15, 2026
Zero-knowledge proofs can verify computing results without rerunning workloads or exposing sensitive data. Magnetar helps bring them into the mainstream with support for standard programming languages, major speed gains, and quantum-resistant security. The post Proof-based general-purpose computing with Magnetar appeared first on Microsoft Research.
MIT News · Artificial Intelligence· news.mit.eduSep 24, 2026