找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Logic, Rationality, and Interaction; 9th International Wo Natasha Alechina,Andreas Herzig,Fei Liang Conference proceedings 2023 The Editor(

[复制链接]
楼主: 中间时期
发表于 2025-3-23 11:49:17 | 显示全部楼层
,A Temporal Logic for Successive Events,ear temporal logic with a new modality to capture the case that a sequence of events successively occurs. We compared the expressivity between this extended linear temporal logic and the standard linear temporal logic.
发表于 2025-3-23 15:11:30 | 显示全部楼层
,On the Finite Model Property of Non-normal Modal Logics,.. We study the algebras corresponding to these logics and give some examples of them. We further introduce the Gentzen-style sequent calculi with soundness and completeness proved. Finally, we prove the FMP of these logics and thus decidability based on our systems by algebraic proof-theoretic methods.
发表于 2025-3-23 18:13:54 | 显示全部楼层
发表于 2025-3-23 22:12:17 | 显示全部楼层
,Reasons in Weighted Argumentation Graphs,favor of or against actions—and their interaction. The interaction between normative reasons is usually made sense of by appealing to the metaphor of (normative) weight scales. This paper substitutes an argumentation-theoretic model for this metaphor. The upshot is a general and precise model that is faithful to the philosophical ideas.
发表于 2025-3-24 02:26:54 | 显示全部楼层
978-3-031-45557-5The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerl
发表于 2025-3-24 07:21:38 | 显示全部楼层
发表于 2025-3-24 14:31:40 | 显示全部楼层
发表于 2025-3-24 17:36:51 | 显示全部楼层
An Inferential Theory of Causal Reasoning,We present a general formalism of causal reasoning that encompasses both Pearl’s approach to causality and a number of key systems of nonmonotonic reasoning in artificial intelligence.
发表于 2025-3-24 21:31:29 | 显示全部楼层
,An Arrow-Based Dynamic Logic of Normative Systems and Its Decidability,Normative arrow update logic (NAUL) is a logic that combines normative temporal logic (NTL) and arrow update logic (AUL). In NAUL, norms are interpreted as arrow updates on labeled transition systems with a CTL-like logic. We show that the satisfiability problem of NAUL is decidable with a tableau method and it is in EXPSPACE.
发表于 2025-3-25 03:03:41 | 显示全部楼层
,Connexivity Meets Church and Ackermann,Here we study two connexive logics based on one of the conditionals introduced by Church in [.] and on some negations defined through falsity constants in the sense of Ackermann in [.].
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-29 01:57
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表