Infinite Recursion
Infinite Recursion is a recursive process in which a function or procedure calls itself without a terminating condition, leading to an unbounded sequence of self-references that never resolves to a base case.
19
Publications
1.3K
Citations
32
Authors
22
Institutions
Publications per year
2017–2026
1
Parents
19
Tabled evaluation with delaying for general logic programs
Weidong Chen, David S. Warren · Journal of the ACM · 1996 · 412 citations · Full text
Eric Gold · Journal of Symbolic Logic · 1965 · 227 citations
Query evaluation under the well-founded semantics
Weidong Chen, David S. Warren · 1993 · 86 citations · Full text
1–5 of 19
32
Scuola Internazionale Superiore di Studi Avanzati, Italy
2 publications · 149 citations
2
h-index
2
h-index
2
h-index
1
h-index
1
h-index
1–5 of 32
22

Scuola Internazionale Superiore di Studi Avanzati
Trieste, Italy
2 h-index
4 publications
233 citations
Southern Methodist University
Dallas, United States
2 h-index
3 publications
584 citations
Endometriosis UK
London, United Kingdom
1 h-index
1 publications
19 citations

McGill University
Montreal, Canada
1 h-index
1 publications
60 citations

University of Edinburgh
Edinburgh, United Kingdom
1 h-index
1 publications
64 citations
Bristol Laboratories (United Kingdom)
Berkhamsted, United Kingdom
1 h-index
1 publications
64 citations
Georgetown University
Washington, United States
1 h-index
2 publications
56 citations
Technische Universität Braunschweig
Braunschweig, Germany
1 h-index
1 publications
13 citations
1–8 of 22
1 publications · 107 citations
1
h-index
NJP · 1 publications · 42 citations
1
h-index
JACM · 1 publications · 412 citations
1
h-index
1 publications · 15 citations
1
h-index
1 publications · 32 citations
1
h-index
1–5