将领域信息嵌入数据结构，实现存储与计算的统一，提升推理效率。
Reasoning as Data: Representation-Computation Unity and Its Implementation in a Domain-Algebraic Inference Engine
- 把领域作为数据结构的一部分，直接支持领域限定推理
- 四元组结构使推理由系统自动完成，无需额外规则
- 适用于医疗分类与临床推理，可处理多继承和时序逻辑
现有知识系统将存储与计算分离。本文证明这种分离非必要，并提出表示-计算统一（RCU）。在标准三元组 is_a(Apple, Company) 中，领域上下文依赖查询或程序员理解；而在四元组 is_a(Apple, Company, @Business) 中，领域成为谓词阶数中的结构性字段。任何尊重阶数的系统都能自动进行领域限定推理。由此衍生出三种机制：领域限定闭包、类型继承和基于域纤维的循环检测写时否决。通过四个定理形式化确立了RCU。实现了2400行的符号推理引擎，解决规则-数据分离、共享纤维处理、只读元层设计及交集收敛等工程问题。核心发现：带领域约束的CDC推理不同于带领域参数的Prolog。两个案例验证：ICD-11分类（1247实体，3个维度）中纤维解决多重继承；CBT临床推理展示对时序推理的泛化能力，会话回合作为有序领域索引。多约束查询实现CSP弧一致性，复杂度为O(m (N/K)^2)，证实领域格稀疏性决定性能。当领域是结构性的，数据即可自行计算。
原文摘要 · Abstract (English)
Every existing knowledge system separates storage from computation. We show this separation is unnecessary and eliminate it. In a standard triple is_a(Apple, Company), domain context lives in the query or the programmer's mind. In a CDC four-tuple is_a(Apple, Company, @Business), domain becomes a structural field embedded in predicate arity. Any system respecting arity automatically performs domain-scoped inference without external rules. We call this representation-computation unity (RCU). From the four-tuple structure, three inference mechanisms emerge: domain-scoped closure, typed inheritance, and write-time falsification via cycle detection per domain fiber. We establish RCU formally via four theorems. RCU is implementable. We present a working symbolic engine (2400 lines Python+Prolog) resolving four engineering issues: rule-data separation, shared-fiber handling, read-only meta-layer design, and intersective convergence. A central result: CDC domain-constrained inference is distinct from Prolog with a domain argument. Two case studies validate the engine. ICD-11 classification (1247 entities, 3 axes) shows fibers resolve multiple inheritance. CBT clinical reasoning shows generalization to temporal reasoning with session turn as ordered domain index. Multi-constraint queries realize CSP arc-consistency with complexity O(m (N/K)^2), confirming the domain lattice's sparsity governs performance. When domain is structural, data computes itself.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。