AI RESEARCH

Grounded Continuation: A Linear-Time Runtime Verifier for LLM Conversations

arXiv CS.AI

ArXi:2605.14175v1 Announce Type: new In long conversations, an LLM can produce a next utterance that sounds plausible but rests on premises the conversation has already abandoned. Context-manipulation attacks against deployed agents now actively exploit this gap. We close it with a runtime verifier that maintains an explicit dependency graph: an LLM classifies each turn into one of 8 update operations drawn from four formalisms (dynamic epistemic logic, abductive reasoning, awareness logic, argumentation), and a symbolic engine records which claims depend on which evidence.