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
Parents
25
Andreas Podelski, Andrey Rybalchenko · 2004 · 252 citations
Andreas Podelski, Andrey Rybalchenko · 2004 · 157 citations
Two variable first-order logic over ordered domains
Martin Otto · Journal of Symbolic Logic · 2001 · 101 citations
Byron Cook, Andreas Podelski, Andrey Rybalchenko · 2007 · 55 citations
Polymorphic higher-order recursive path orderings
Jean-Pierre Jouannaud, Albert Rubio · Journal of the ACM · 2007 · 52 citations · Full text
Computing, Computer Science, Algebra +12
1–5 of 25
37
3
h-index
3
h-index
2
h-index
2
h-index
1
h-index
1–5 of 37
27

University of Freiburg
Freiburg im Breisgau, Germany
2 h-index
2 publications
91 citations
Max Planck Institute for Informatics
Saarbrücken, Germany
2 h-index
4 publications
818 citations
Wichita State University
Wichita, United States
2 h-index
4 publications
100 citations
Microsoft (United States)
Redmond, United States
2 h-index
2 publications
84 citations
Universitat Politècnica de Catalunya
Barcelona, Spain
1 h-index
1 publications
52 citations
Laboratoire de Statistique Théorique et Appliquée
Paris, France
1 h-index
1 publications
46 citations

Swansea University
Swansea, United Kingdom
1 h-index
1 publications
101 citations

Centre National de la Recherche Scientifique
Paris, France
1 h-index
1 publications
10 citations
1–8 of 27
2 publications · 134 citations
2
h-index
1 publications · 39 citations
1
h-index
JACM · 1 publications · 52 citations
1
h-index
Repository · 1 publications · 16 citations
1
h-index
Repository · 1 publications · 21 citations
1
h-index
1–5