用忆阻器阵列实现三值逻辑推理，硬件直接表达领域知识与推理规则。
Ternary Memristive Logic: Hardware for Reasoning Realized via Domain Algebra
- 每个忆阻结点存储真/假/未定义的逻辑断言，通过三态电阻实现。
- 芯片在10万次测试中零错误，支持跨轴查询与传递性推理。
- 适合需要低功耗、高可靠逻辑推理的嵌入式医疗诊断系统。
忆阻交叉阵列传统上用于存储数值权重并需聚合解码；单个结点本身无意义。本文提出根本性新用法：每个结点直接存储一个领域限定的完整逻辑断言（成立/否定/未定义），三态电阻状态直接编码这些值。我们建立域代数到阵列拓扑的保结构映射：域对应独立阵列，专化对应有向布线，关系类型控制继承门，跨域连接变为显式寄存器。物理布局即代数体现；改换布线即改变推理语义。我们详细设计了一款ICD-11呼吸疾病分类芯片（含1,247个实体，约13.6万颗1T1R结点），支持领域作用域、三值逻辑、传递级联、类型化继承和跨轴查询。行为仿真（sigma_log=0.15，SNR=20dB）显示每项任务10万次测试均无错误，且容忍度宽。与以往将表示与计算统一于软件不同，本工作将二者统一于硬件：读取一个结点即回答一个问题，无需符号解释。
原文摘要 · Abstract (English)
Memristive crossbars store numerical weights needing aggregation and decoding; a single junction means nothing alone. This paper presents a fundamentally different use: each junction stores a complete, domain-scoped logical assertion (holds/negated/undefined). Ternary resistance states encode these values directly. We establish a structure-preserving mapping from a domain algebra to crossbar topology: domains become isolated arrays, specialization becomes directed wiring, relation typing controls inheritance gates, and cross-domain links become explicit registers. The physical layout thus embodies the algebra; changing wiring changes reasoning semantics. We detail an ICD-11 respiratory disease classification chip (1,247 entities, ~136k 1T1R junctions) enabling domain scoping, three-valued logic, transitive cascade, typed inheritance, and cross-axis queries. Behavioral simulation (sigma_log=0.15, SNR=20dB) shows error-free operation across 100,000 trials per task with wide tolerance margins. Where prior work unified representation and computation in software, this work unifies them in hardware: reading one junction answers one question, without symbolic interpretation.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。