Well-founded Relations

Well-Founded Relations is a mathematical relation on a set such that every non-empty subset has a minimal element with respect to the relation, thereby ensuring the absence of infinite descending chains and enabling inductive reasoning in termination analysis.

25

Publications

1.1K

Citations

37

Authors

27

Institutions

Publications per year

2017–2026

1

Variants

Well-founded Relation

Authors

37

  1. AP
    Andreas Podelski

    University of Freiburg, Germany

    3 publications · 464 citations

    3

    h-index

  2. AR
    Andrey Rybalchenko

    Max Planck Institute for Informatics, Germany

    3 publications · 464 citations

    3

    h-index

  3. RB
    Rajiv Bagai

    Wichita State University, United States

    2 publications · 50 citations

    2

    h-index

  4. RS
    Rajshekhar Sunderraman

    Georgia State University, United States

    2 publications · 50 citations

    2

    h-index

  5. AK
    Adam Koprowski

    Tsinghua University, China

    1 publications · 46 citations

    1

    h-index

1–5 of 37

Venues

  1. Journal of Symbolic Logic

    2 publications · 134 citations

    2

    h-index

  2. International Journal of Computer Mathematics

    1 publications · 39 citations

    1

    h-index

  3. Journal of the ACM

    JACM · 1 publications · 52 citations

    1

    h-index

  4. arXiv (Cornell University)

    Repository · 1 publications · 16 citations

    1

    h-index

  5. Defense Technical Information Center (DTIC)

    Repository · 1 publications · 21 citations

    1

    h-index

1–5