Axiomatizations of causal reasoning under indeterministic causal laws
非确定性因果规律下因果推理的公理化AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
本页为预印本版本;arXiv 收录、作者填写的期刊信息以及作者既有发表经历,都不单独证明本篇已接收。作者发表记录按 OpenAlex 身份与完整姓名、本站覆盖期刊 ISSN 及正式卷期核对,只展示已核实例,档案仍可能误合并。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要聚焦因果逻辑、语义和公理化,没有明确的计量识别或估计问题可对应所给细分。
非确定性因果规律下因果推理的公理化AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
We investigate the generalization of causal models to the case of indeterministic causal laws that was suggested in Halpern (2000). We give an overview of what differences in modeling are enforced by this more general perspective, and propose an implementation of generalized models in the style of the causal team semantics of Barbero & Sandu (2020). In these models, the laws are not represented by functions (as in the deterministic case), but more generally by relations. We point out significant differences in the indeterministic vs. the deterministic case, both for what concerns the axiomatization of counterfactuals and the definability of causal notions in terms of them. We notice, for instance, that the notions of parenthood and direct cause, differently from the deterministic case, come apart. We provide two main strongly complete axiomatizations, one for the class of indeterministic causal models and one for their team generalizations, which can also represent uncertainty about the state of the system. Then, we also identify axioms that allow specializing the axiomatizations to a number of significant subclasses, characterized by properties such as acyclicity, totality and determinism of the causal laws. We also see that a minor change in the notion of signature of the models has a dramatic impact; in particular, it makes so that the deterministic subclass of models become undefinable in the usual Halpern-style counterfactual language. We see that the definability of determinism can be recovered either by a restriction of the class of models, by allowing right-nested counterfactuals, or by introducing an operator for information update.