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 “Most A are B” and axioms for “most” are defined. We introduce an Euler diagrammatic system for defeasible reasoning by introducing circle mA that represents “most A” for each circle A. 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.
CITATION STYLE
Takemura, R. (2020). Euler Diagrams for Defeasible Reasoning. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12169 LNAI, pp. 289–304). Springer. https://doi.org/10.1007/978-3-030-54249-8_23
Mendeley helps you to discover research relevant for your work.