decidability

This paper presents a formal theory for defining reuse of answers in governed conversational AI systems, replacing similarity heuristics with mathematically characterized quotient spaces of resolved utterances.

This paper analyzes the size complexity and decidability of first-order progression in the Situation Calculus, showing that for local-effect, normal, and acyclic actions, progression grows polynomially and remains within decidable fragments such as two-variable first-order logic.