Logical and geometrical distance in polyhedral Aristotelian diagrams in knowledge representation (Q2333411)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Logical and geometrical distance in polyhedral Aristotelian diagrams in knowledge representation
scientific article

    Statements

    Logical and geometrical distance in polyhedral Aristotelian diagrams in knowledge representation (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    13 November 2019
    0 references
    Summary: Aristotelian diagrams visualize the logical relations among a finite set of objects. These diagrams originated in philosophy, but recently, they have also been used extensively in artificial intelligence, in order to study (connections between) various knowledge representation formalisms. In this paper, we develop the idea that Aristotelian diagrams can be fruitfully studied as geometrical entities. In particular, we focus on four polyhedral Aristotelian diagrams for the Boolean algebra \(\mathbb{B}_4\), viz. the rhombic dodecahedron, the tetrakis hexahedron, the tetraicosahedron and the nested tetrahedron. After an in-depth investigation of the geometrical properties and interrelationships of these polyhedral diagrams, we analyze the correlation (or lack thereof) between logical (Hamming) and geometrical (Euclidean) distance in each of these diagrams. The outcome of this analysis is that the Aristotelian rhombic dodecahedron and tetrakis hexahedron exhibit the strongest degree of correlation between logical and geometrical distance; the tetraicosahedron performs worse; and the nested tetrahedron has the lowest degree of correlation. Finally, these results are used to shed new light on the relative strengths and weaknesses of these polyhedral Aristotelian diagrams, by appealing to the congruence principle from cognitive research on diagram design.
    0 references
    0 references
    0 references
    0 references
    0 references
    logical geometry
    0 references
    Boolean algebra
    0 references
    knowledge representation
    0 references
    bitstrings
    0 references
    rhombic dodecahedron
    0 references
    tetrakis hexahedron
    0 references
    tetraicosahedron
    0 references
    nested tetrahedron
    0 references
    Hamming distance
    0 references
    Euclidean distance
    0 references
    congruence principle
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references