Euler diagrams for defeasible reasoning

Euler diagrams for defeasible reasoning
复制标题

用于可废止推理的欧拉图

DOI:
10.1007/978-3-030-54249-8_23
复制
发表时间:
2020
期刊:
Diagrammatic Representation and Inference, Lecture Notes in Computer Science
影响因子:
--
通讯作者:
Ryo Takemura
Ryo Takemura
中科院分区:
--
文献类型:
--
作者:
Jeremiah Alberg;Eve Grace;Christopher Kelly;Ryo Takemura;Ryo Takemura;竹村亮;Ryo Takemura

文献摘要

相似文献

我们通过扩展与标准经典逻辑相对应的欧拉和维恩图的常用系统来研究可失效推理的欧拉图系统。为了实现这一目标,我们使用广义量词“most”来形式化可废止推理,如 Schlechta (1995) 所提出的,其中可废止知识表示为“MostAareB”,并定义了“most”的公理。我们通过引入代表每个圆A的“mostA”的circlemA来引入用于可废推理的欧拉图解系统。我们证明我们的欧拉图解系统是广义量词“最”的符号系统的图解表示。此外,我们用欧拉图研究了可废推理中的怀疑和轻信策略。
We investigate Euler diagrammatic systems for defeasible reasoning by extending the usual systems for Euler and Venn diagrams corresponding to standard classical logic. To achieve this, we use the generalized quantifier “most” to formalize defeasible reasoning, as proposed by Schlechta (1995), where defeasible knowledge is represented as “MostAareB” and axioms for “most” are defined. We introduce an Euler diagrammatic system for defeasible reasoning by introducing circlemAthat represents “mostA” for each circleA. We show that our Euler diagrammatic system is a diagrammatic representation of the symbolic system of the generalized quantifier “most”. Furthermore, we investigate skeptical and credulous strategies in defeasible reasoning with our Euler diagrams.