NM-DEKL$^3_\infty$: A Three-Layer Non-Monotone Evolving Dependent Type Logic
We present a new dependent type system, NM-DEKL$^3_\infty$ (Non-Monotone Dependent Knowledge-Enhanced Logic), for formalising evolving knowledge in dynamic environments. The system uses a three-layer architecture separating a computational layer, a constructive knowledge layer, and a propositional knowledge layer. We define its syntax and semantics and establish Soundness and Equational Completeness; we construct a syntactic model and prove that it is initial in the category of models, from which equational completeness follows. We also give an embedding into the $μ$-calculus and a strict expressiveness inclusion (including the expressibility of non-bisimulation-invariant properties).
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Robustness Certificates for Implicit Neural Networks: A Mixed Monotone Contractive Approach
Implicit neural networks are a general class of learning models that replace the layers in traditional feedforward models with implicit algebraic equations. Compared to traditional learning models, implicit networks offe…
Adversarial RobustnessDeep Ensemble Kernel Learning
Gaussian processes (GPs) are nonparametric Bayesian models that are both flexible and robust to overfitting. One of the main challenges of GP methods is selecting the kernel. In the deep kernel learning (DKL) paradigm, a…
Gaussian Processes$\mathcal{H}_{\infty}$-optimal Interval Observer Synthesis for Uncertain Nonlinear Dynamical Systems via Mixed-Monotone Decompositions
This paper introduces a novel $\mathcal{H}_{\infty}$-optimal interval observer synthesis for bounded-error/uncertain locally Lipschitz nonlinear continuous-time (CT) and discrete-time (DT) systems with noisy nonlinear ob…
Neural Q-learning for solving PDEs
Solving high-dimensional partial differential equations (PDEs) is a major challenge in scientific computing. We develop a new numerical method for solving elliptic-type PDEs by adapting the Q-learning algorithm in reinfo…
Q-LearningMulti-agent online learning in time-varying games
We examine the long-run behavior of multi-agent online learning in games that evolve over time. Specifically, we focus on a wide class of policies based on mirror descent, and we show that the induced sequence of play (a…