Problem-solving Arguments

Problem-Solving Arguments is a type of mathematical argumentation that consists of structured reasoning aimed at justifying the validity, applicability, or effectiveness of a specific problem-solving contribution—such as a method, model, framework, or metric—by demonstrating its logical coherence, procedural soundness, and alignment with mathematical principles.

10

Publications

595

Citations

16

Authors

13

Institutions

Publications per year

2017–2026

2

Authors

16

  1. AA
    Andrew A. Tawfik

    University of Memphis, United States

    2 publications · 110 citations

    2

    h-index

  2. RD
    Roland De Guio

    Institut National des Sciences Appliquées de Strasbourg, France

    1 publications · 23 citations

    1

    h-index

  3. MJ
    Matthew J. Brown

    The University of Texas at Dallas, United States

    1 publications · 16 citations

    1

    h-index

  4. BM
    Bolette Moldenhawer

    University of Copenhagen, Denmark

    1 publications · 17 citations

    1

    h-index

  5. VL
    Victor Law

    University of New Mexico, United States

    1 publications · 79 citations

    1

    h-index

1–5 of 16

Venues

  1. Argumentation

    1 publications · 29 citations

    1

    h-index

  2. Computers in Human Behavior

    1 publications · 79 citations

    1

    h-index

  3. Choice Reviews Online

    CRO · 1 publications · 11 citations

    1

    h-index

  4. 1

    h-index

  5. SSRN Electronic Journal

    Repository · 1 publications · 16 citations

    1

    h-index

1–5