We propose ZX-Calculus (Knowledge Evolution Calculus), a conservative extension of Martin-Lof Dependent Type Theory (MLTT) integrating trace-indexed types, presheaf non-monotone semantics, and constructive AGM belief revision. A Coq mechanisation accompanies the paper (34 complete proofs; zero admits for the two central results). (I) Trace types. FinTrace(s0,sn) is an inductive family of typed execution traces. FinTrace and Star(Step) are isomorphic as path types but not judgementally equal; TraceElim exposes the event label e:Event explicitly, giving a more ergonomic interface for event-driven induction. We prove the Trace-Reachability Correspondence, Deterministic Replay, and a canonicity framework via reducibility candidates with a Transport Lemma (RC-elim deferred; all other Core results are Coq-verified). (II) Sheaf semantics. Trace-indexed propositions are contravariant sheaves over the free trace partial-order category Tf. A Separation Theorem (explicit countermodel) distinguishes proof-theoretic monotonicity from semantic non-monotonicity. The term model is an initial CwF (syntactic universal property, not classical completeness). (III) AGM belief revision. We give an explicit constructive partial meet contraction algorithm verified against (C1)-(C4). All eight AGM postulates (R1)-(R8) are theorems. Proofs of R7 and R8 use the Disjunctive Entrenchment Lemma, given a self-contained constructive derivation. (IV) Integration. B^AGM fails the sheaf composition law BP-comp for sequential revision (explicit countermodel, Coq-verified). We introduce Single-Step Revision Systems (SSRS), prove B^AGM is a valid SSRS (Coq-verified), and show this suffices for trace morphisms, retraction characterisation, and revision witnesses. The BP-comp failure reveals a fundamental tension between path-dependent belief revision and functor consistency, not previously identified.
An Application of a Runtime Epistemic Probabilistic Event Calculus to Decision-making in e-Health Systems
University of Verona(维罗纳大学);University of Naples Federico II(那不勒斯费德里科二世大学)
我们提出并讨论了一个运行时架构,集成了感官数据和分类器与基于逻辑的决策系统的背景下,电子健康系统的儿童神经运动障碍的康复。在该应用中,儿童以游戏的形式执行康复任务。该系统的主要目的是导出一组参数,该参数是儿童的认知和行为表现的当前水平(例如,参与、注意力、任务准确性)从可用的传感器和分类器(例如,眼睛跟踪器、运动传感器、情感识别技术)并相应地做出决定。这些决定通常旨在通过在孩子注意力低下时触发适当的重新参与刺激来提高孩子的表现,通过改变游戏或当孩子对任务失去兴趣时使其变得更加困难,因为它太容易了。除了最先进的技术,情绪识别和头部姿态估计,我们使用的概率和认知逻辑编程方言的事件演算,称为认知概率事件演算的运行时变体。特别地,该符号框架的概率组件允许与机器学习技术的自然接口。我们概述了架构及其组件,并通过一个运行的例子和实验的讨论,它的一些特点。《逻辑程序设计理论与实践》(Theory and Practice of Logic Programming,TPLP)