6 found
Order:
  1. A Diagrammatic Inference System with Euler Circles.Koji Mineshima, Mitsuhiro Okada & Ryo Takemura - 2012 - Journal of Logic, Language and Information 21 (3):365-391.
    Proof-theory has traditionally been developed based on linguistic (symbolic) representations of logical proofs. Recently, however, logical reasoning based on diagrammatic or graphical representations has been investigated by logicians. Euler diagrams were introduced in the eighteenth century. But it is quite recent (more precisely, in the 1990s) that logicians started to study them from a formal logical viewpoint. We propose a novel approach to the formalization of Euler diagrammatic reasoning, in which diagrams are defined not in terms of regions as in (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  2.  67
    How Diagrams Can Support Syllogistic Reasoning: An Experimental Study.Yuri Sato & Koji Mineshima - 2015 - Journal of Logic, Language and Information 24 (4):409-455.
    This paper explores the question of what makes diagrammatic representations effective for human logical reasoning, focusing on how Euler diagrams support syllogistic reasoning. It is widely held that diagrammatic representations aid intuitive understanding of logical reasoning. In the psychological literature, however, it is still controversial whether and how Euler diagrams can aid untrained people to successfully conduct logical reasoning such as set-theoretic and syllogistic reasoning. To challenge the negative view, we build on the findings of modern diagrammatic logic and introduce (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  3.  69
    A Generalized Syllogistic Inference System based on Inclusion and Exclusion Relations.Koji Mineshima, Mitsuhiro Okada & Ryo Takemura - 2012 - Studia Logica 100 (4):753-785.
    We introduce a simple inference system based on two primitive relations between terms, namely, inclusion and exclusion relations. We present a normalization theorem, and then provide a characterization of the structure of normal proofs. Based on this, inferences in a syllogistic fragment of natural language are reconstructed within our system. We also show that our system can be embedded into a fragment of propositional minimal logic.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  4.  31
    Can Negation Be Depicted? Comparing Human and Machine Understanding of Visual Representations.Yuri Sato, Koji Mineshima & Kazuhiro Ueda - 2023 - Cognitive Science 47 (3):e13258.
    There is a widely held view that visual representations (images) do not depict negation, for example, as expressed by the sentence, “the train is not coming.” The present study focuses on the real-world visual representations of photographs and comic (manga) illustrations and empirically challenges the question of whether humans and machines, that is, modern deep neural networks, can recognize visual representations as expressing negation. By collecting data on the captions humans gave to images and analyzing the occurrences of negation phrases, (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  5.  25
    A presuppositional analysis of definite descriptions in proof theory.Koji Mineshima - 2008 - In Takashi Washio, Ken Satoh, Hideaki Takeda & Akihiro Inokuchi (eds.), New Frontiers in Artificial Intelligence. Springer. pp. 214--227.
  6.  40
    Variable Handling and Compositionality: Comparing DRT and DTS.Yukiko Yana, Koji Mineshima & Daisuke Bekki - 2019 - Journal of Logic, Language and Information 28 (2):261-285.
    This paper provides a detailed comparison between discourse representation theory and dependent type semantics, two frameworks for discourse semantics. Although it is often stated that DRT and those frameworks based on dependent types are mutually exchangeable, we argue that they differ with respect to variable handling, more specifically, how substitution and other operations on variables are defined. This manifests itself in two recalcitrant problems posed for DRT; namely, the overwrite problem and the duplication problem. We will see that these problems (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark