From Events to Reasoning: Hierarchical Rule Composition over Explicit States

arXiv cs.AI Papers
reasoning event-graphs rule-composition symbolic-ai explainability planning

Summary

论文提出事件推理系统（ERS），将推理状态显式表示为事件图，通过低层可复用规则与可递归组合的高层控制规则构建可解释、可修订的推理路径，在结构化事件图上实现长依赖链、零无关操作与高效的动态子目标控制。

arXiv:2610.22403v1 Announce Type: new Abstract: What a reasoning system emits is a conclusion; what it owes is a justification. Producing one requires every operation to be admissible on the facts actually available, the dependencies of intermediate results to survive to the end of the path, and the path to be revised when a premise changes. We present the Event Reasoning System (ERS), in which the reasoning state is an explicit event graph. Semantic features nominate candidate objects and rule bindings, and declared rule and task conditions decide which may execute, so candidates that violate the represented period, unit, or evidence constraints cannot enter an accepted reasoning path. Low-level rules provide reusable local transformations, and recursively composable high-level control rules organize subgoals and legal paths under the current goal, information gaps, and budget; a finite library is thereby rebound into paths never stored as complete solutions. We formalize admissible transitions, task-dependent control, compositional expressivity, dependency-preserving revision, and the gap between reachable solutions and those a budgeted controller finds. On structured-event graphs, ERS builds dependency chains of up to twelve steps, cuts irrelevant executed domain operations from 32 to 0 as lookahead grows to 16, and produces no unsupported target output across 24 negative cases; with rules frozen, it passes 12/12 focused checks comprising nine accepted derivations involving unseen input/path combinations and three justified refusals, as well as 6/6 fact-change cases. On fourteen jointly solved development tasks, the recorded dynamic subgoal configuration uses 51.6% less inference wall-clock time than single-level global control under their respective frozen settings.
Original Article
View Cached Full Text

Cached at: 10/19/26, 07:01 AM 

# From Events to Reasoning: Hierarchical Rule Composition over Explicit States
Source: [https://arxiv.org/abs/2610.22403](https://arxiv.org/abs/2610.22403)
[View PDF](https://arxiv.org/pdf/2610.22403)

> Abstract:What a reasoning system emits is a conclusion; what it owes is a justification\. Producing one requires every operation to be admissible on the facts actually available, the dependencies of intermediate results to survive to the end of the path, and the path to be revised when a premise changes\. We present the Event Reasoning System \(ERS\), in which the reasoning state is an explicit event graph\. Semantic features nominate candidate objects and rule bindings, and declared rule and task conditions decide which may execute, so candidates that violate the represented period, unit, or evidence constraints cannot enter an accepted reasoning path\. Low\-level rules provide reusable local transformations, and recursively composable high\-level control rules organize subgoals and legal paths under the current goal, information gaps, and budget; a finite library is thereby rebound into paths never stored as complete solutions\. We formalize admissible transitions, task\-dependent control, compositional expressivity, dependency\-preserving revision, and the gap between reachable solutions and those a budgeted controller finds\. On structured\-event graphs, ERS builds dependency chains of up to twelve steps, cuts irrelevant executed domain operations from 32 to 0 as lookahead grows to 16, and produces no unsupported target output across 24 negative cases; with rules frozen, it passes 12/12 focused checks comprising nine accepted derivations involving unseen input/path combinations and three justified refusals, as well as 6/6 fact\-change cases\. On fourteen jointly solved development tasks, the recorded dynamic subgoal configuration uses 51\.6% less inference wall\-clock time than single\-level global control under their respective frozen settings\.

## Submission history

From: Cheng Lyu \[[view email](https://arxiv.org/show-email/a6f8c8fd/2610.22403)\] **\[v1\]**Wed, 14 Oct 2026 12:47:40 UTC \(4,219 KB\)

Similar Articles

Abstract Event Causal Rules: Induction and Application

arXiv cs.AI

This paper proposes Abstract Event Causal Rules (AECR), a relation-level causal abstraction paradigm that converts concrete cause-effect pairs into generalized causal logic. It introduces a multi-agent system for causal induction and an attention-based encoder that improves event prediction, especially for rare and unseen events.