On the Stability and Realizability of Recurrent Polynomial Surrogate Ternary Logic Gate Networks 文章

ArXiv CS.AI2026-05-26NEWSen作者: Sai Sandeep Damera, Ryan Matheu, Aniruddh G. Puranic, John S. Baras, Calin Belta

详细信息

来源站点
ArXiv CS.AI
作者
Sai Sandeep Damera, Ryan Matheu, Aniruddh G. Puranic, John S. Baras, Calin Belta
文章类型
NEWS
语言
en
发布日期
2026-05-26

摘要

arXiv:2605.24649v1 Announce Type: cross Abstract: Recurrent Neural Networks (RNNs) can learn to predict Signal Temporal Logic (STL) verdicts online from partial trajectories, but deploying them as runtime monitors in safety-critical systems demands more than predictive accuracy. Standard RNN architectures offer no structural guarantee that outputs degrade gracefully under sensor degradation; a dropped input can silently flip a verdict from safe to unsafe. We introduce the Recurrent Differentiable Ternary Logic Gate Network (R-DTLGN), a recurrent architecture that operates over Kleene's three-valued logic $\{-1, 0, +1\}$, where $0$ explicitly represents unknown. The R-DTLGN trains through continuous polynomial surrogates and hardens to a discrete ternary logic circuit at inference.

相关事件

暂无数据

相关公司查看全部 (3)

A
ACTNONPROFIT

相关人物

暂无数据